递归思想（河内塔）

#include <stdio.h>

void hanoi(int n, char A, char B, char C) 
{
    if (n == 1) {
        printf("Move sheet %d from %c to %c\n", n, A, C);
    }
    else {
        hanoi(n - 1, A, C, B);
        printf("Move sheet %d from %c to %c\n", n, A, C);
        hanoi(n - 1, B, A, C);
    }
}

int main() 
{
    int n;
    printf("请输入盘数：");
    scanf("%d", &n);
    hanoi(n, 'A', 'B', 'C');
    return 0;
}

【15-河内塔递归问题的可视化】https://www.bilibili.com/video/BV1Mv4y1c7wA?vd_source=786b25bd17022d589237198bce717868