老师，后面章节何时更新啊

from queue import PriorityQueue class myqueue(object): def __init__(self,que_len): self.que_len=que_len self.myqueue= PriorityQueue() def put(self,pri,item): self.myqueue.put((pri,item)) def get(self,item): if not self.empty(): self.myqueue.get() def print_queue(self): while not self.myqueue.empty(): priority,item=self.myqueue.get() print(priority,item) myQueue = myqueue(1) myQueue.put(3,123) myQueue.put(1,234) myQueue.put(2,456) myQueue.print_queue()

class MyQueue: '''定义一个队列''' def __init__(self, maxsize = 10) -> None: self.maxsize = maxsize self.queue = [] def full(self): '''队列最大长度''' return 0 < self.maxsize <= len(self.queue) def empty(self): '''队列长度为 0''' self.queue.clear() pass def put(self, item): '''放入数据''' if not self.full(): self.queue.append(item) def get(self, item): '''取出数据''' if not self.empty(): self.queue.pop() class PriorityQueue(MyQueue): def putTop(self, item, topFlag): if topFlag: return self.queue.insert(0, item) return super().put(item) q = PriorityQueue() q.put('1') q.put('2') q.put('3') q.putTop('0', True) print(q.queue)

from queue import PriorityQueue '''自定义一个支持插入数据优先级功能,即优先级高的数据,插入队列时能够得到更靠前的位置,以便更早得到处理的队列''' class Myqueue: def __init__(self, maxsize=10): self.maxsize = maxsize self.queue = PriorityQueue() # PriorityQueue类构建的数据结构不是列表；让属性 queue 能继承 PriorityQueue 类的方法，并传递给实例； def full(self): return self.queue.qsize() == self.maxsize # 队列满了,返回 True def empty(self): return self.queue.empty() # 队列为空,返回 True def put(self, priority:int, item): if self.full(): print("Queue is full, can't put into any itmes.") else: self.queue.put((priority, item)) # 把要插入队列的元素按照‘优先级，数据’以元祖的格式传递给 put 方法 def get(self): if self.empty(): print('Queue is empty, no items can be fetched.') else: return self.queue.get()[1] # 取出优先级最高的元素后,返回元祖结构(优先级，数据)中的数据 def item_num(self): print(f'Queue can have {self.maxsize - self.queue.qsize()} more items.') myque = Myqueue(3) # print(myque.full()) myque.item_num() myque.put(3, 'apple') myque.put(2, 'pear') myque.put(1, 'banana') # myque.put(1, 'water') # print(myque.full()) myque.item_num() while not myque.empty(): print(myque.get()) # myque.get() myque.item_num()

from heapq import heappush, heappop class MyQueue(object): '''定义一个队列''' def __init__(self, maxsize=10) -> None: '''初始化队列长度''' self.maxsize = maxsize self.queue = [] def _qsize(self) -> int: return len(self.queue) def full(self) -> bool: '''队列最大长度''' return 0 < self.maxsize <= self._qsize() def empty(self) -> bool: '''队列长度为0''' return not self._qsize() def put(self, priority: int, item: str) -> list: '''放入队列数据''' if not self.full(): # self.queue.insert(0, item) heappush(self.queue, (priority, item)) def get(self) -> str: '''取出数据''' if not self.empty(): # return self.queue.pop() return heappop(self.queue)[1] myq = MyQueue(3) print(myq.empty()) myq.put(3, 123) myq.put(2, 456) myq.put(1, 789) print(myq.full()) print(myq.queue) print("取出数据为 %s" % (myq.get())) print("取出数据为 %s" % (myq.get())) print("取出数据为 %s" % (myq.get())) print(myq.empty())

import heapq ,copy class MyQueue: '''定义一个队列''' def __init__(self, maxsize=10): '''初始化队列长度''' self.maxsize = maxsize self.queue = [] def full(self): '''队列最大长度''' return 0 < self.maxsize <= len(self.queue) def empty(self): '''队列长度为 0''' return not len(self.queue) def put(self, item): '''放入数据''' if not self.full(): self.queue.insert(0, item) print(self.queue) def get(self): '''取出数据''' if not self.empty(): return self.queue.pop() class MyPriorityQueue(MyQueue): '''按优先级表处理列表''' # 用堆排序处理，用库heapq def __init__(self,maxsize=10): '''初始化输入值队列''' super().__init__(maxsize) self.queue_a = [] self.queue_b = [] def pro_put(self,item): '''放入数据''' if not self.full(): self.queue_a.append(item) self.pro_mer() def pro_mer(self): '''合并两个有序列表''' # 用堆排序合并出来 self.queue = list(heapq.merge(sorted(self.queue_a), sorted(self.queue_b))) self.queue_b = copy.deepcopy(self.queue) self.queue_a = [] myq = MyPriorityQueue(10) myq.pro_put(3423) myq.pro_put(123) myq.pro_put(456) myq.pro_put(789) print(myq.full()) # True print(myq.get()) print(myq.get()) print(myq.get()) print(myq.empty()) # True

参考源码如下 class PriorityQueue(Queue): '''Variant of Queue that retrieves open entries in priority order (lowest first). Entries are typically tuples of the form: (priority number, data). ''' def _init(self, maxsize): self.queue = [] def _qsize(self): return len(self.queue) def _put(self, item): heappush(self.queue, item) def _get(self): return heappop(self.queue) 参考后修改如下： from heapq import heappush, heappop class MyQueue: '''定义一个队列''' def __init__(self, maxsize=10): '''初始化队列长度''' self.maxsize = maxsize self.queue = [] def full(self): '''队列最大长度''' return 0 < self.maxsize <= len(self.queue) def empty(self): '''队列长度为 0''' return not len(self.queue) def put(self,priority, item): '''放入数据''' if not self.full(): heappush(self.queue, (priority, item)) def get(self): '''取出数据''' if not self.empty(): return heappop(self.queue)[1] myq = MyQueue(3) # 优先级越小越先获取 myq.put(3, 123) #优先级3 myq.put(2, 456) #优先级2 myq.put(1, 789) #优先级1 print(myq.full()) # True print("取出数据为%s" % (myq.get())) print("取出数据为%s" % (myq.get())) print("取出数据为%s" % (myq.get())) print(myq.empty()) # True