src=https://bbs.csdn.net/topics/a, DST=c, mid=b;
Hanoi principle I understand, is the first n - 1 posts from A to B (by excessive C), then A last directly moved to C, and then the B n - 1 on the plate as A set, the original disc A as b. but A code to look not to understand,
Questions: 1: I don't understand how to implement the code from A to B,
2: the else the first statement is soon began to recursion? How is the second recursive Hanoi begin

CodePudding user response:

Refer to the https://bbs.csdn.net/topics/395826094