由于解决河内塔始终把2 ^ N - 1步......不，你不会找到一个更快的算法，因为它需要O（2 ^ n）的刚打印出的步骤，更不用说计算它们。

Given that solving Towers of Hanoi always takes 2^n - 1 steps...no, you're not going to find a faster algorithm, because it takes O(2^n) just to print out the steps, much less compute them.