Efficient Solution to the Tower of Hanoi Problem Using Iteration

It is a code that uses iterative approach to solve the Tower of Hanoi Puzzle instead of using recursion. The iterative implementation reduces the overhead of recursive function calls and potentially result in faster execution times for larger numbers of disks.

本代码采用迭代方法而非递归方式求解汉诺塔谜题（Tower of Hanoi Puzzle）。该迭代实现能够降低递归函数调用带来的额外开销，在圆盘数量较多的场景下，有望获得更快的执行效率。