C 递归解决汉诺塔问题

#include<stdio.h>

int step=0;

void Hanoi(int n,char x,char y,char z)
{
    if(n==1)
    {
        ++step;
        printf("第%d步,%C-->%C\n",step,x,z);
    }
    else
    {

        Hanoi(n-1,x,z,y);
        ++step;
        printf("第%d步,%C-->%C\n",step,x,z);
        Hanoi(n-1,y,x,z);
    }
}
int main()
{
    int n;
    printf("请输入汉诺塔的个数:");
    scanf("%d",&n);
    Hanoi(n,'x','y','z');
    printf("汉诺塔移动完毕,共%d步\n",step)；
    return 0;
}