汉诺塔源代码，可输入需要移动的盘子数目，便可以看到移动步骤。可计算总的移动步骤数目-Tower of Hanoi source code, enter the number plate needs to be moved, we can see the moving steps. Calculate the total number of mobile steps

使用C语言实习的Linux终端下的汉诺塔游戏，可以根据难度选择N的大小，N越大，难度就越高-source code of hannuo tower game written by C,it is my first do something by C myself,fighting!

数据结构经典算法，汉诺塔问题的求解，C#实现，链栈和顺序栈实现-Data structure classic algorithm, Tower of Hanoi problem solving, C# achieve chain stack and sequential stack implementation