关于python的简单优先级队列

• 实现优先级队列相对队列主要有两方面需要考虑:

  • 1. 封装元素和优先级放在一起(可以封装一个新的类)

  • 1. 添加元素时, 将当前的优先级和队列中已经存在的元素优先级进行比较, 以获得自己正确的位置.

（硬控我2个半小时😭😭） 

class PrioritQueue:
    class Node:
        def __init__(self, itme, level):
            self.item = itme
            self.level = level

    def __init__(self):
        self.queue = []
        self.size = 0

    def empty(self):
        return self.size == 0

    def enqueue(self, itme, level1):
        num = 0
        itme = self.Node(itme, level1)

        if self.size == 0:
            self.size += 1
            return self.queue.append(itme)

        while num < self.size:
            if self.size - 1 != num:
                if level1 < self.queue[num].level:
                    self.queue.insert(num, itme)
                    self.size += 1
                    return True
            else:
                if level1 < self.queue[num].level:
                    self.queue.insert(num, itme)
                    self.size += 1
                    return True
                else:
                    self.queue.append(itme)
                    self.size += 1
                    return True
            num += 1
        self.size += 1
        return self.queue.append(itme)
    def dequeue(self):
        return self.queue.pop(0)
    def size(self):
        return self.size
    def front(self):
        return self.queue[0]

p1 = PrioritQueue()
p1.enqueue(111, 2)
p1.enqueue(222, 1)
p1.enqueue(333, 3)
p1.enqueue(444, 2)
p1.enqueue(555, 4)

for i in p1.queue:
    print(i.item, i.level)