[第二轮] 3/4-3/10 CareerCup 3.4

In the classic problem of the Towers of Hanoi, you have 3 towers and N disks of different sizes which can slide onto any tower. The puzzle starts with disks sorted in ascending order of size from top to bottom (i.e., each disk sits on top of an even larger one). You have the following constraints:
(1) Only one disk can be moved at a time.
(2) A disk is slid off the top of one tower onto the next tower.
(3) A disk can only be placed on top of a larger disk.
Write a program to move the disks from the first tower to the last using stacks.

发帖规范:
http://www.1point3acres.com/bbs/thread-48094-1-1.html
http://www.1point3acres.com/bbs/thread-32423-1-1.html

I don't know what the connection between the problem and the Stack is...Anyway, it is a classic problem. Using recursion could solve that.

EchoMemory 发表于 2013-3-3 21:31
I don't know what the connection between the problem and the Stack is...Anyway, it is a classic prob ...

Since all recursive algorithm implicitly uses stack, I think what they are asking is to convert the original recursive algorithm into an iterative algorithm that explicitly uses stack

ryancooper 发表于 2013-3-4 09:32
Since all recursive algorithm implicitly uses stack, I think what they are asking is to convert th ...

I see,thx:)

EchoMemory 发表于 2013-3-3 21:31
I don't know what the connection between the problem and the Stack is...Anyway, it is a classic prob ...

Maybe they just want you to use stacks to simulate towers...

EchoMemory 发表于 2013-3-3 21:31
I don't know what the connection between the problem and the Stack is...Anyway, it is a classic prob ...

看了一下答案 还真是。。。晕

https://gist.github.com/ThunderXu/5124029
use recursion, if I wish to move all n disks from 1 to 3, I should move all n-1 disks from 1 to 2 first to let the nth disk to be move from 1 to 3, and to move all n-1 disks from 1 to 2 I should...

https://github.com/quantumrose/C ... .TowersOfHanoi.java

递归，用stack表示tower
https://gist.github.com/chrislukkk/5159124

f(n) = 2 f(n-1) + 1
*  f(N) = O(2^N)
*  
*  useful link : http://blog.csdn.net/xujinsmile/article/details/8091738
*  此人代码写的有点混乱。。。。
*  自己果然只是中人之资  智力硬伤。。。
*  对递归的认识还不够。。。别人写的代码能看懂，自己想就跪了。。。。。。。