Python priority queue solution

  • 0

    The get and set is O(logn), a bit slower than the O(1) doubly linked list solution:

    REMOVED = '<removed-key>'
    # @param capacity, an integer
    def __init__(self, capacity):
        self.capacity = capacity
        self.cache = {}
        self.pq = []
        self.size = 0
        self.counter = 0
    # @return an integer
    def get(self, key):
        if key not in self.cache:
            return -1
        priority, key, value = self.cache[key]
        if priority != self.counter:
            self.add(key, value)
        return value
    def remove(self, key):
        entry = self.cache.pop(key)
        entry[1] = self.REMOVED
    def add(self, key, value):
        self.counter += 1
        entry = [self.counter, key, value]
        self.cache[key] = entry
        heapq.heappush(self.pq, entry)
    # @param key, an integer
    # @param value, an integer
    # @return nothing
    def set(self, key, value):
        if key in self.cache:
            if self.size < self.capacity:
                self.size += 1
                while self.pq:
                    _, k, _ = heapq.heappop(self.pq)
                    if k is not self.REMOVED:
                        del self.cache[k]
        self.add(key, value)

  • 0

    deque better than heapq

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.