法一:
public class day11 {
public static void main(String[] args) {
java.util.Scanner s=new java.util.Scanner(System.in);
int k=s.nextInt();
int sum =1;
for (int i=1;i<=k;i++){
sum *=i;
}
System.out.println(sum);
}
}
法二
public class day11 {
public static void main(String [] args){
java.util.Scanner s = new java.util.Scanner(System.in);
int i = s.nextInt();
int result = sum(i);
System.out.println(result);
}
public static int sum(int k){
if (k==1)
{return 1;}
return k*sum(k-1);
}
}*/
法二无法算太大的阶乘,会出现爆栈。