数据结构-汉诺塔

代码如下：

#include <stdio.h>

void hanoi(int paraN, char paraSource, char paraDestination, char paraTransit) {
    if (paraN <= 0) {
        return;
    } else {
        hanoi(paraN - 1, paraSource, paraTransit, paraDestination);
        printf("%c -> %c \r\n", paraSource, paraDestination);
        hanoi(paraN - 1,paraTransit, paraDestination, paraSource);
    }
}

void hanoiTest() {
    printf("---- hanoiTest begins. ----\r\n");
    
    printf("2 plates\r\n");
    hanoi(2, 'A', 'B', 'C');
    
    printf("3 plates\r\n");
    hanoi(3, 'A', 'B', 'C');
    
    printf("---- hanoiTest ends. ----\r\n");
}

void main() {
    hanoiTest();
}

运行结果如下：

---- hanoiTest begins. ----
2 plates
A -> C 
A -> B 
C -> B 
3 plates
A -> B 
A -> C 
B -> C 
A -> B 
C -> A 
C -> B 
A -> B 
---- hanoiTest ends. ----


...Program finished with exit code 27
Press ENTER to exit console.