递归方法的使用
public class RecursionTest {
public static void main(String[] args) {
int sum=0;
for(int i=1;i<=100;i++){
sum+=i;
}
System.out.println(sum);
RecursionTest test = new RecursionTest();
int Sum=test.getSum(100);
System.out.println(Sum);
int SUM=test.getSum1(100);
System.out.println(SUM);
int value= test.f(10);
System.out.println(value);
int F=test.Fibo(6);
System.out.println(F);
}
public int getSum(int n){
if(n==1){
return 1;
}else {
return n+getSum(n-1);
}
}
public int getSum1(int n){
if(n==1){
return 1;
}else {
return n*getSum(n-1);
}
}
public int f(int n){
if(n==0){
return 1;
}else if(n==1){
return 4;
}else {
return 2*f(n-1)+f(n-2);
}
}
public int Fibo(int n){
if(n==1){
return 1;
}else if(n==2){
return 1;
}else {
return Fibo(n-1)+Fibo(n-2);
}
}
}