update

2026-08-30 17:10:48 +08:00 · 2020-07-02 10:24:23 -07:00
parent 90118ea545
commit 003a01ac98
11 changed files with 369 additions and 245 deletions
@@ -53,16 +53,15 @@ class QueuePrior:
        return len(self.queue) == 0

    def put(self, item, priority):
-        flag = 0
+        heapq.heappush(self.queue, (priority, item))  # reorder x using priority
+
+    def update(self, item, priority):
        count = 0
        for (p, x) in self.queue:
            if x == item:
                self.queue[count] = (priority, item)
-                flag = 1
                break
            count += 1
-        if flag == 0:
-            heapq.heappush(self.queue, (priority, item))  # reorder x using priority

    def get(self):
        return heapq.heappop(self.queue)[1]  # pop out the smallest item