qq_44170902的博客

public class TestJieCheng { public static void jiecheng(int n) { int result = 1; while(n > 1){ result *= n * (n - 1); n -= 2; } System.out.println("n的阶乘为：" + result); } public stat.

public class TestRecursion { public static int factorial(int n) { if (n == 1){ return 1; }else{ return n * factorial(n-1); } } public static void main(String[] args) { System.out.println.