问题:
在经典的汉诺塔问题中,有 3 个塔和 N 个可用来堆砌成塔的不同大小的盘子。要求盘子必须按照从小到大的顺序从上往下堆 (如,任意一个盘子,其必须堆在比它大的盘子上面)。同时,你必须满足以下限制条件:
(1) 每次只能移动一个盘子。
(2) 每个盘子从堆的顶部被移动后,只能置放于下一个堆中。
(3) 每个盘子只能放在比它大的盘子上面。
请写一段程序,实现将第一个堆的盘子移动到最后一个堆中。
样例:
样例1:
输入: 3 输出: towers[0]: [] towers[1]: [] towers[2]: [2,1,0]
样例2:
输入: 10 输出: towers[0]: [] towers[1]: [] towers[2]: [9,8,7,6,5,4,3,2,1,0]
python:
class Tower:
"""
@param: i: An integer from 0 to 2
"""
def __init__(self, i):
# create three towers
self.disks = []
"""
@param: d: An integer
@return: nothing
"""
def add(self, d):
# Add a disk into this tower
if len(self.disks) > 0 and self.disks[-1] <= d:
print("Error placing disk %s" % d)
else:
self.disks.append(d)
"""
@param: t: a tower
@return: nothing
"""
def moveTopTo(self, t):
# Move the top disk of this tower to the top of t.
t.add(self.disks.pop())
"""
@param: n: An integer
@param: destination: a tower
@param: buffer: a tower
@return: nothing
"""
def move_disks(self, n, destination, buffer):
# Move n Disks from this tower to destination by buffer tower
if n > 0:
self.move_disks(n-1, buffer, destination)
self.moveTopTo(destination)
buffer.move_disks(n-1, destination, self)
"""
@return: Disks
"""
def get_disks(self):
# write your code here
return self.disks
"""
Your Tower object will be instantiated and called as such:
towers = [Tower(0), Tower(1), Tower(2)]
for i in xrange(n - 1, -1, -1): towers[0].add(i)
towers[0].move_disks(n, towers[2], towers[1])
print towers[0], towers[1], towers[2]
C++:
class Tower {
private:
stack<int> disks;
public:
/*
* @param i: An integer from 0 to 2
*/
Tower(int i) {
// create three towers
}
/*
* @param d: An integer
* @return: nothing
*/
void add(int d) {
// Add a disk into this tower
if (!disks.empty() && disks.top() <= d) {
printf("Error placing disk %d", d);
} else {
disks.push(d);
}
}
/*
* @param t: a tower
* @return: nothing
*/
void moveTopTo(Tower &t) {
// Move the top disk of this tower to the top of t.
t.add(disks.top());
disks.pop();
}
/*
* @param n: An integer
* @param destination: a tower
* @param buffer: a tower
* @return: nothing
*/
void moveDisks(int n, Tower &destination, Tower &buffer) {
// Move n Disks from this tower to destination by buffer tower
if (n > 0)
{
moveDisks(n-1,buffer,destination);
moveTopTo(destination);
buffer.moveDisks(n - 1, destination, *this);
}
}
/*
* @return: Disks
*/
stack<int> getDisks() {
// write your code here
return disks;
}
};
/**
* Your Tower object will be instantiated and called as such:
* vector<Tower> towers;
* for (int i = 0; i < 3; i++) towers.push_back(Tower(i));
* for (int i = n - 1; i >= 0; i--) towers[0].add(i);
* towers[0].moveDisks(n, towers[2], towers[1]);
* print towers[0], towers[1], towers[2]
*/
PS:先明确要写的函数只有moveToTop和moveDisks,而且Python和C++的测试接口不一致,需要修改Python中的参数名。