public class diguitext{ public static void main(String[] args){ int result = jiecheng(100); System.out.println(result); } //递归算法。方法本身调用自己 public static int jiecheng2(int num){ if(num==1)return 1; return num*jiecheng2(num-1); } public static int jiecheng1(int num){ int result = num; int i = num-1; do{ result = result * i; i--; }while(i>1); return result; } }
递归算法。
最新推荐文章于 2024-09-13 16:27:15 发布