代码如下：
1.package com.chen.base.method;
public class Demo05 {
public static void main(String[] args) {
Demo05 test = new Demo05();
test.test();
}
public void test(){
test();
}
}
2.package com.chen.base.method;
public class Demo06 {
//递归思想
//能不用递归就不用递归 用递归前提是基数比较小
public static void main(String[] args) {
System.out.println(f(6));
}
public static int f(int n){
if (n==1){
return 1;
}else {
return n*f(n-1);
}
}
}
package practice;
import java.util.Scanner;
public class Demo19 {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.println("num1=");
double num1 = scanner.nextDouble();
System.out.println("运算符：");
String Str = scanner.next();
System.out.println("num2=");
double num2 = scanner.nextDouble();
double result = 0;
switch (Str) {
case "+":
result = num1 + num2;
break;
case "-":
result = num1 - num2;
break;
case "*":
result = num1 * num2;
break;
case "/":
result = num1 / num2;
break;
default:
System.out.println("输入错误！！！请重新输入：");
}
System.out.println(num1 + Str + num2 + "=" + result);
scanner.close();
}
}
点击跳转视频
加油！追梦人。
