著名的世界末日问题-河内之塔(Towers of Hanoi) 的递归算法很容易实现,但效率不过,但非递归算法会写的人却很少,这个非递归算法不但高效,并且简短-The end of the world well-known problem- Hanoi Tower (Towers of Hanoi) of the recursive algorithm is very easy to realize, but efficiency, however, non-recursive algorith