#include "linkStack.h"
void hanoi( int n , char a , char b , char c ) {
if ( 1==n ) {
cout << a << "--->" << c << endl;
}
else {
hanoi(n-1,a,c,b);
cout << a << "--->" << c << endl;
hanoi(n-1,b,a,c);
}
}
int main(int argc, char **argv) {
hanoi( 2 , 'A','B','C');
system( "pause" );
return 0;
}
12_栈的递归实例3---汉诺塔
最新推荐文章于 2021-11-06 22:21:06 发布