#include <stdio.h>
void hanoi( int n, char from, char temp, char to) {
// 终止条件:只有1个圆盘时,直接从源柱移到目标柱
if ( n == 1 ) {
printf ( "%c -> %c\n " , from
, to
) ; return ;
}
// 步骤1:将n-1个圆盘从from移到temp(用to作为辅助)
hanoi( n - 1 , from, to, temp) ;
// 步骤2:将第n个圆盘从from移到to
printf ( "%c -> %c\n " , from
, to
) ;
// 步骤3:将n-1个圆盘从temp移到to(用from作为辅助)
hanoi( n - 1 , temp, from, to) ;
}
int main( ) {
int n;
// 调用递归函数,初始柱子为A,辅助为B,目标为C
hanoi( n, 'A' , 'B' , 'C' ) ;
return 0 ;
}
I2luY2x1ZGUgPHN0ZGlvLmg+Cgp2b2lkIGhhbm9pKGludCBuLCBjaGFyIGZyb20sIGNoYXIgdGVtcCwgY2hhciB0bykgewogICAgLy8g57uI5q2i5p2h5Lu277ya5Y+q5pyJMeS4quWchuebmOaXtu+8jOebtOaOpeS7jua6kOafseenu+WIsOebruagh+afsQogICAgaWYgKG4gPT0gMSkgewogICAgICAgIHByaW50ZigiJWMgLT4gJWNcbiIsIGZyb20sIHRvKTsKICAgICAgICByZXR1cm47CiAgICB9CgogICAgLy8g5q2l6aqkMe+8muWwhm4tMeS4quWchuebmOS7jmZyb23np7vliLB0ZW1w77yI55SodG/kvZzkuLrovoXliqnvvIkKICAgIGhhbm9pKG4gLSAxLCBmcm9tLCB0bywgdGVtcCk7CgogICAgLy8g5q2l6aqkMu+8muWwhuesrG7kuKrlnIbnm5jku45mcm9t56e75YiwdG8KICAgIHByaW50ZigiJWMgLT4gJWNcbiIsIGZyb20sIHRvKTsKCiAgICAvLyDmraXpqqQz77ya5bCGbi0x5Liq5ZyG55uY5LuOdGVtcOenu+WIsHRv77yI55SoZnJvbeS9nOS4uui+heWKqe+8iQogICAgaGFub2kobiAtIDEsIHRlbXAsIGZyb20sIHRvKTsKfQoKaW50IG1haW4oKSB7CiAgICBpbnQgbjsKICAgIHByaW50Zigi6K+36L6T5YWl5rGJ6K+65aGU55qE5ZyG55uY5pWw6YeP77yaIik7CiAgICBzY2FuZigiJWQiLCAmbik7CgogICAgLy8g6LCD55So6YCS5b2S5Ye95pWw77yM5Yid5aeL5p+x5a2Q5Li6Qe+8jOi+heWKqeS4ukLvvIznm67moIfkuLpDCiAgICBoYW5vaShuLCAnQScsICdCJywgJ0MnKTsKCiAgICByZXR1cm4gMDsKfQo=