算法思路：

　　1.如果只有一个金片，则把该金片从源移动到目标棒，结束。

　　2.如果有n个金片，则把前n-1个金片移动到辅助的棒，然后把自己移动到目标棒，最后再把前n-1个移动到目标棒.

　　3.单纯对于有N个金片要挪动的步数求出, 可以使用递推方法,满足递推方程f(i) = f(i - 1) * 2 + 1-Algorithm idea: 1. If there is only a gold film, while the gold from the source to the target mobile wand, The End. 2. If there are n gold films, while the former n-1 gold piece to move to the auxiliary rod, and then move to the goal of their own stick, then the last n-1 before moving to the target rod. 3. Simply to have N a gold piece to move step calculated, you can use recursive methods to meet the recursive equation f (i) = f (i- 1)* 2+ 1