public class Recursion {
public static void main(String[] args){
System.out.println(f1(3));
}
/*1*2*3*.......*n =f(n) =f(n-1)*n
*
*/
public static long f1(int n){
if(n==1){
return 1;
}
return n*f(n-1);
}
public static void main(String[] args){
System.out.println(f1(3));
}
/*1*2*3*.......*n =f(n) =f(n-1)*n
*
*/
public static long f1(int n){
if(n==1){
return 1;
}
return n*f(n-1);
}
if(n==1){
return 1;
}
return n*f1(n-1);
}是没问题呢!!