//递归求n的阶乘 private static int factorial(int n){ if(n==1) return 1; return factorial(n-1)*n; }
递归求n的阶乘
最新推荐文章于 2024-08-06 11:07:44 发布
//递归求n的阶乘 private static int factorial(int n){ if(n==1) return 1; return factorial(n-1)*n; }