Java与C++分别用递归实现汉诺塔详解

#include<iostream>
using namespace std;
int H_tower(int num);
int main()
{
	int num;
	cout<<"请输入需要移动的盘子数"<<endl;
	cin>>num;
	cout<<H_tower(num)<<endl;
 }
 int H_tower(int num)
 {
 	if(num<1)
	 {
	 	cout<<"请输入大于等于一的数"<<endl;
		 exit(-1); //输入不合法，退出程序 
	  } 
	if(num==1)
	{
		return 1;
	}
	return (2*H_tower(num-1)+1);//规律递归 
 }

#include<iostream>
using namespace std;
 void hannuo(int num);
 void Move(int &sum,int num,char A,char B,char C);
 int main()
 {
 		int num;
	cout<<"请输入需要移动的盘子数"<<endl;
	cin>>num;
	hannuo(3);
 }
 void hannuo(int num)
 {
 	if(num<1)
 	{
 			cout<<"请输入大于等于一的数"<<endl;
		 exit(-1); //输入不合法，退出程序 
	 }
	 int sum=0;
	 Move(sum,num,'A','B','C');
 }
 void Move(int &sum,int num,char A,char B,char C)
 {
 	if(num==1)
 	{
 		sum++;
 		//圆盘只有一个时，只需将其从A塔移到C塔
		cout << "第 "<<sum<<" 次move " << num << " from " << A << " to " << C << endl;
	 }
	else
	{
		Move(sum,num - 1, A, C, B);//递归，把A塔上编号1~n-1的圆盘移到B上，以C为辅助塔
		sum++;
		cout << "第 "<<sum<<" 次move " << num << " from " << A << " to " << C << endl;//把A塔上编号为n的圆盘移到C上
		Move(sum,num - 1, B, A, C);//递归，把B塔上编号1~n-1的圆盘移到C上，以A为辅助塔
	}
  } 

import java.util.Scanner;
public class hannuo {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int num;
        System.out.println("请输入需要移动的盘子数");
        num= sc.nextInt();
        tower t=new tower();
        System.out.println("需要移动的次数 = "+t.H_tower(num));
    }
}

public class tower {
    public int H_tower(int num) {
        if (num < 1) {
            System.out.println("请输入大于等于一的数" );
        }
        if (num == 1) {
            return 1;
        }
        return (2 * H_tower(num - 1) + 1);//规律递归
    }
}

import java.util.Scanner;
public class hannuo {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int num;
        System.out.println("请输入需要移动的盘子数");
        num= sc.nextInt();
        tower t=new tower();
        t.hannuo(num);
    }
}

public class tower {
    public void hannuo(int num)
    {
        if(num<1)
        {
            System.out.println("请输入大于等于一的数");
        }
        int sum[]={0};
        Move(num,'A','B','C');
    }
    public void Move(int num,char A,char B,char C)
    {
        if(num==1)
        {
            //圆盘只有一个时，只需将其从A塔移到C塔
            System.out.println(" move " + num + " from " + A + " to " + C );
        }
        else
        {
            Move(num - 1, A, C, B);//递归，把A塔上编号1~n-1的圆盘移到B上，以C为辅助塔
            System.out.println(" move " + num + " from " + A + " to " + C );//把A塔上编号为n的圆盘移到C上
            Move(num - 1, B, A, C);//递归，把B塔上编号1~n-1的圆盘移到C上，以A为辅助塔
        }
    }
}