递归方式实现斐波那契数列&汉诺塔（java）

斐波那契数列：

<span style="font-size:14px;">public class FibDemo {
	
	public static void main(String[] args)
	{
		System.out.println(fibNum(2,3,7));
	}
	
	
	public static int fibNum(int a,int b,int n)
	{
		if(n==1)
			return a;
		else if(n==2)
			return b;
		else 
			return fibNum(a,b,n-1)+fibNum(a,b,n-2);
	}

}
</span>

汉诺塔：

<span style="font-size:14px;">public class Hanoi {
	
	public static void main(String[] args)
	{
		move(4,"A","B","C");
	}
	
	public static void move(int n,String a,String b,String c)
	{
		if(n==1)
			System.out.println(n+"...from..."+a+"...to..."+c);
		else{
			move(n-1,a,c,b);
			System.out.println(n+"...from..."+a+"...to..."+c);
			move(n-1,b,a,c);
		}
	}

}</span><span style="font-size:18px;">
</span>

输出结果：