class PrioQue:
def __init__(self, elist = []):
self.elems = list(elist)
self.elems.sort(reverse = True) # 由大到小排序
def is_empty(self):
return self.elems == []
def peek(self):
if self.is_empty():
raise PrioQueueError("in top")
return self.elems[-1]
实现方式1：sorted list
11/20/2022
评论0
最新资源