摘要：
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 ... 阅读全文
posted @ 2015-07-26 11:45
Grandyang
阅读(1791)
评论(0)
推荐(0)
摘要：
3.3 Imagine a (literal) stack of plates. If the stack gets too high, it might topple. Therefore, in real life, we would likely start a new stack when ... 阅读全文
posted @ 2015-07-26 08:08
Grandyang
阅读(1179)
评论(0)
推荐(0)
浙公网安备 33010602011771号