递归-汉诺塔

C++

#include 
using namespace std;

//将src座上的n个盘子,以mid座位中转,移动到dest座
void Hanoi(int n,char src,char mid,char dest)
{
    if(n==1)
    {
        //直接将盘子从src移动到dest即可
        cout<"<"<>n; //n代表盘子数
    Hanoi(n,'A','B','C');
    return 0;
}

Java

import java.io.*;
class test  
{
    public static void hanoi(int n,char a,char b,char c)
    {
        if(n==1)
            System.out.println(a + "->" + c);
        else
        {
            hanoi(n-1,a,c,b);
            System.out.println(a + "->" + c);
            hanoi(n-1,b,a,c);
        }
            
    }
    public static void main (String[] args) throws java.lang.Exception
    {
        hanoi(4,'A','B','C');
    }
}