递归算法---汉诺塔1

public class Hanoi {
	public static int sum=0;

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		hanoi(2, 'A', 'B', 'C');
		System.out.println(sum);
	}
	private static void hanoi(int n,char a,char b,char c) {
		// TODO Auto-generated method stub
		if (n==1) {
			System.out.println(a+"-->"+c);
			sum++;
		}
		else {
			hanoi(n-1, a, c, b);
			System.out.println(a+"-->"+c);
			sum++;
			hanoi(n-1, b, a, c);
		}
	}

}