编程不是我的强项,虽然这项作业没有在截止日期前完成,但我想至少在明年重新参加类(class)之前了解它是如何工作的。
该计划的全部意义在于成为一个船厂管理系统,处理装在不能超过 2000 磅的容器中的新包裹,否则它会为同一目的地创建一个新容器。
编辑 3:这是更新后的代码。不好意思没说清楚!! :<
class Shipyard:
def __init__(self):
self._cont = self.Container(None, None, None, None)
self._size = 0
def __len__(self):
return self._size
def isEmpty(self):
return self._size == 0
def add_pack(self, owner, dest, weight):
# adds package when container check is done
# If shipyard is empty or container name is alphabetically lower than
# the first container by destination name.
if self.isEmpty() or dest < self._cont._first._dest:
self._size += 1
self._cont._first = self.Container(owner, dest, \
weight, self._cont._first)
self._cont._first.add_pack(owner, dest, weight)
return
# Else will go through the contents of the linkedlist to find the spot
# it belongs to.
cur_Cont = self._cont._first
while(cur_Cont._next != None and dest > cur_Cont._next._dest):
cur_Cont = cur_Cont._next
if dest == cur_Cont._dest:
if (cur_Cont._weight + weight) > 2000:
self._size += 1
cur_Cont._next = self.Container(owner, dest, \
weight, cur_Cont._next)
cur_Cont._next.add_pack(owner, dest, weight)
return
if (cur_Cont._weight + weight) <= 2000:
cur_Cont.add_pack(owner, dest, weight)
return
if (cur_Cont._next._weight + weight) <= 2000:
cur_Cont._next.add_pack(owner, dest, weight)
return
self._size += 1
# Creates a new container with the given sepcifications.
cur_Cont._next = self.Container(owner, dest, weight, cur_Cont._next)
cur_Cont._next.add_pack(owner, dest, weight)
return
def traversePrint(self) : # Use for Printing Container
cur_Cont = self._cont._first # Modify to include details
c_weight = cur_Cont._weight
while cur_Cont != None: # of container or packages
c_weight = cur_Cont._weight
print(cur_Cont._dest, c_weight)
cur_Cont.traversePrint()
cur_Cont = cur_Cont._next
# -----------------------------------------------------------------------------
# Nested within the Shipyard
class Container:
def __init__(self, owner, dest, weight, next):
self._owner = owner
self._dest = dest
self._first = None
self._size = 0
self._weight = 0
self._next = next
self._pack = self.Packages(None, None, None, None)
def __len__(self):
return self._size
def isEmpty(self):
return self._size == 0
def add_pack(self, owner, dest, weight):
# Add pack for container class which adds a package.
if self.isEmpty() or weight < self._pack._first._weight:
self._size += 1
self._pack._first = self.Packages(owner, dest, \
weight, self._pack._first)
self._weight += weight
return
cur_Pack = self._pack._first
while(cur_Pack._next != None and weight > cur_Pack._next._weight):
cur_Pack = cur_Pack._next
if weight == cur_Pack._weight:
self._size += 1
cur_Pack._next = self.Packages(owner, dest, \
weight, cur_Pack._next)
self._weight += weight
return
self._size += 1
cur_Pack._next = self.Packages(owner, dest, \
weight, cur_Pack._next)
self._weight += weight
return
def traversePrint(self):
cur_Pack = self._pack._first # Modify to include details
p_weight = cur_Pack._weight
while cur_Pack != None: # of container or packages
p_weight = cur_Pack._weight
if cur_Pack._dest == self._pack._dest:
print(cur_Pack._owner, cur_Pack._dest, p_weight, end = " ")
cur_Pack = cur_Pack._next
else:
print(cur_Pack._owner, cur_Pack._dest, p_weight)
cur_Pack = cur_Pack._next
# -----------------------------------------------------------------------------
# Nested within Container doesn't contain any methods
class Packages:
def __init__(self, owner, dest, weight, next):
self._first = None
self._size = 0
self._owner = owner
self._dest = dest
self._weight = weight
self._next = next
# -----------------------------------------------------------------------------
class Weight(Exception):
pass
# -----------------------------------------------------------------------------
shipyard = Shipyard()
len(shipyard)
shipyard.add_pack("Lori", "Bristol", 300)
shipyard.add_pack("Mallory", "Bristol", 200)
shipyard.add_pack("Chung", "Alabama", 700)
shipyard.add_pack("Roger", "Alabama", 900)
shipyard.add_pack("Ali", "Giza", 45)
shipyard.add_pack("Soumick", "New Delhi", 600)
shipyard.add_pack("Mizuki", "Tokyo", 1900)
shipyard.add_pack("Tadashi", "Tokyo", 120)
shipyard.add_pack("Kanna", "Tokyo", 220)
shipyard.traversePrint()
这是程序运行时出现的内容:
Alabama 1600
Chung Alabama 700
Roger Alabama 900
Bristol 500
Mallory Bristol 200
Lori Bristol 300
Giza 45
Ali Giza 45
New Delhi 600
Soumick New Delhi 600
Tokyo 220
Kanna Tokyo 220
Tokyo 120 # THIS AND Tokyo 220 must be added into the same container
Tadashi Tokyo 120 # I don't know what I didn't include because
Tokyo 1900 # It seems to me that Alabama 700 and Alabama 900 were
Mizuki Tokyo 1900 # Adding Correctly.
问题编辑:应该添加的包没有加在一起,而是创建了一个全新的容器。我不知道代码的哪一部分现在搞砸了 T_T。
如果有任何问题,请在下面的评论中问我。
感谢阅读。
编辑:我计划在 Container 部分使用额外的 add_pack(owner, dest, weight) 来保存所有者输入/参数,并将在 add_pack(owner,dest, weight) 的 Shipyard 版本中调用
编辑 2:所以我能够解决最初的问题,但现在我有另一个问题/疑问。是的,学校要求我们使用链表,否则我们得不到分数。现在我的新问题是我不知道是否应该在 Shipyard 方法 add_pack 中更新容器类的权重,或者我是否应该在 Container 类中使用 add_pack 时更新它。
编辑 3.5:所以我更新了代码,现在它清楚地显示了两个 add_pack 方法:一个在 Shipyard 类中,一个在 Container 类中。抱歉,错误的编辑和格式。我真的很沮丧,因为我无法弄清楚这件事。
编辑 4:我在 Container 和 Shipyard 上都有 traversePrint。 Shipyard 的 traversePrint 列出容器,Container 的 traversePrint 列出容器内的包裹。我能够显示包 w/c 让我相信它们被正确添加。
编辑 5:我主要想出了如何添加容器和包装到容器中,但一些条件检查,即如果两件东西的重量加起来超过 2000 磅,其他加到同一个东西中 <- 这是行不通的。
请您参考如下方法:
将问题分解成可处理的 block :
- 记录所需的可交付产品(如您目前所做的那样)
- 确定每个目的地需要多少个容器(可能是
math.ceil(weight(dest)/2000.0)或类似的东西)
所以你的用法会变成
shipyard.add_pack("X", "dest", 500)
shipyard.add_pack("X", "dest", 1500)
shipyard.add_pack("X", "dest", 2200)
...
containers = {
dest: shipyard.containers_for(dest)
for dest in shipyard.destinations()
}
