打印n层汉诺塔从最左边移动到最右边的全部过程
输入描述:
输入一个大于0的正整数


输出描述:
n层汉诺塔从最左边移动到最右边的全部过程
示例1

输入

3

输出

Move 1 from left to right
Move 2 from left to mid
Move 1 from right to mid
Move 3 from left to right
Move 1 from mid to left
Move 2 from mid to right
Move 1 from left to right
加载中...