漢諾塔問題

把大問題劃分成小問題

package wang;
/*漢諾塔問題*/
public class hanoi {



    public static void main(String[] args) {
        System.out.println("漢諾塔：+");
        System.out.println();

    }
        // TODO Auto-generated method stub
        public static void hanoi(int n,int a,int b,int c)//n是盤數
        {
            if(n>0)
            {
                hanoi(n-1,a,c,b);//將n-1個盤子a移至c藉助b
                move(a,b);//交換a,b
                hanoi(n-1,c,b,a);//將n-1個盤子c移至b藉助a


        }




    }
        private static void move(int a, int b) {
            // TODO Auto-generated method stub

        }

}