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(factorial(10)); } }
求阶乘-递归
最新推荐文章于 2025-05-17 13:34:47 发布
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(factorial(10)); } }