package 递归方法; public class RescursionTest { public static void main(String[] args) { // // 方法一: 一百数求和 // int sum=0; // for (int i =1; i<=100;i++) { // sum +=1; // } //方法二: RescursionTest test= new RescursionTest(); int sum1= test.getsum(100); System.out.println(sum1); //乘积: RescursionTest test1= new RescursionTest(); int sum2= test.getsum1(100); System.out.println(sum2); //斐波那契数列 RescursionTest test2 = new RescursionTest(); int sum3= test.Fibonacci(5); System.out.println(sum3); } public int getsum(int n) { if (n==1) { return 1; }else { return n + getsum(n-1); } } //计算1——n所有自然数的乘积 public int getsum1(int n) { if (n==1) { return 1; }else { return n * getsum(n-1); } } //斐波那契数列 public int Fibonacci(int n) { if(n == 1) { return 1; } if(n == 2) { return 1; } return Fibonacci(n-1) + Fibonacci(n-2); } }