详细步骤都再注释里了~
public class HowToCreateRecursion {
public static void iToJ(int i,int j)
{
if(i>j)
return;
System.out.println(i);
iToJ(i+1,j);
}
public static int sumArr(int a[],int begin)
{
if(begin==a.length-1)
return a[a.length-1];
return a[begin]+sumArr(a,begin+1);
}
public static String reverse(String str,int end) {
if(end==0)
return ""+str.charAt(0);
return str.charAt(end)+reverse(str,end-1);
}
public static int fib(int n)
{
if(n==1||n==2)
return 1;
return fib(n-1)+fib(n-2);
}
public static int zuiDaGongYueShu(int m,int n)
{
if(n==0)
return m;
return zuiDaGongYueShu(n,m%n);
}
public static void main(String[] args) {
iToJ(8,18);
System.out.println(sumArr(new int []{1,2,3,4,5},0));
System.out.println(reverse(new String("abcdef"),5));
System.out.println(fib(5));
System.out.println(zuiDaGongYueShu(16,12));
}
}