这是一个简单的汉诺塔问题求解，用递归实现。 输入一个汉诺塔盘子的个数，然后求出具体的移动过程。-This is a simple Tower of Hanoi problem-solving, using recursion. Enter a Tower of Hanoi plate number, and then find the specific process of moving.