Can someone please convert the switch/case code into if/else statements and the
ID: 3902775 • Letter: C
Question
Can someone please convert the switch/case code into if/else statements and the if/else statements to switch/case? thanks.
public static void main(String[] args) throws Exception {
switch(args[0]){
case "hello":
switch(args[1]){
case "one":
test1();
break;
case "two":
test2();
break;
}
break;
case "bye":
Time(Integer.parseInt(args[1]),
Integer.parseInt(args[2]));
break;
}
}
**************************************************************************************************************************************************************
if(car == null){
return false;
}
int compare = car.getDat().compareTo(Dat);
if(compare > 0){
return contains(Dat, car.getLeft());
}
else if(compare < 0){
return contains(Dat, car.getRight());
}
else{
return true;
}
}
*******************************************************************************************************************************************************************************************
if(car== null) {
return null;
} else if(car.getLeft() == null) {
return car;
} else {
return findMin(car.getLeft());
}
*****************************************************************************************************************************************************************
if(car== null) {
return new BinaryNode<>(Dat);
}
int compare = car.getDat().compareTo(Dat);
if(compare > 0) {
car.setLeft(insert(Dat, car.getLeft()));
} else if(compare < 0) {
car.setRight(insert(Dat, car.getRight()));
}
return car;
Explanation / Answer
public static void main(String[] args) throws Exception {
if(args[0].equals("hello"){
if(args[1].equals("one"){
test1();}
else if(args[1].equals("two"))
test2();
}
else if (args[0].equals("bye")){
Time(Integer.parseInt(args[1]),
Integer.parseInt(args[2]));
}
}
**************************************************************************************************************************************************************
switch(car){
case null:
return false;
int compare = car.getDat().compareTo(Dat);
switch(compare)
{
case 1:
return contains(Dat, car.getLeft());
case 0:
return true;
case -1:
return contains(Dat, car.getRight());
}
}
*******************************************************************************************************************************************************************************************
switch(car){
case null:
return null;
switch(car.getLeft())
{
case null:
return car;
default:
return findMin(car.getLeft());
}
}
*****************************************************************************************************************************************************************
if(car== null) {
return new BinaryNode<>(Dat);
}
int compare = car.getDat().compareTo(Dat);
if(compare > 0) {
car.setLeft(insert(Dat, car.getLeft()));
} else if(compare < 0) {
car.setRight(insert(Dat, car.getRight()));
}
return car;
switch(car){
case null:
return new BinaryNode<>(Dat);
int compare = car.getDat().compareTo(Dat);
switch(compare)
{
case 1:
car.setLeft(insert(Dat, car.getLeft()));
break;
case 0:
return car;
case -1:
car.setRight(insert(Dat, car.getRight()));
break;
}
}
Do give a thumbs up