//调用可变参数
printMax(34,3,3,2,56.5);
printMax (new double[]{1,2,3});
}
private static void printMax(double... numbers) {
if(numbers.length == 0){
System.out.println ("No argument passed");
return;
}
double result = numbers[0];
//排序!
for (int i = 1; i <numbers.length;i++){
if(numbers[i] > result) {
result = numbers[i];
}
}
System.out.println ("The max value is"+result);
}
}
//递归 就是自己调用自己
//递归思想
//边界条件:边界
//前阶段:
//返回阶段 n* (n-1)
public static void main(String[] args) {
System.out.println (f(1));
}
public static int f(int n) {
if(n==1){
return 1;
}else{
return n*f(n-1);
}
}
}