单列汉诺塔问题：将汉诺塔的金盘按任意顺序叠成一列，我们试图通过某些操作，将其按照小盘在上大盘在下的规则排列整齐。由于没有可用于暂时存放金盘的柱子，我们可以执行的唯一操作是将金盘列的最上面若干层翻过来，不允许从中间或者底部抽出金盘进行翻转。用递归实现-Single Liehannuota problem: The Tower of Hanoi gold disc in any order folded column, we tried to pass some operations, which in accordance with the rules of the market in the next small-cap neatly arranged. Since there is no gold plate can be used for temporary storage of the pillars, the only action we can take is to the top of the column of several layers of gold plate over and do not allow extraction of gold　the middle or the bottom of the pan to flip. Using recursive