Leetcode: sword finger offer 59 - ii Maximum value of queue [deque + sortedlist]

analysis

Whatever it is o1
Just pick it up sortedlist + deque Simulation is enough

ac code

from sortedcontainers import SortedList


class MaxQueue:

    def __init__(self):
        self.lst = SortedList()
        self.q = deque([])


    def max_value(self) -> int:
        if not self.q: return -1
        return self.lst[-1]


    def push_back(self, value: int) -> None:
        self.q.append(value)
        self.lst.add(value)


    def pop_front(self) -> int:
        if not self.q: return -1
        val = self.q.popleft()
        self.lst.remove(val)
        return val



# Your MaxQueue object will be instantiated and called as such:
# obj = MaxQueue()
# param_1 = obj.max_value()
# obj.push_back(value)
# param_3 = obj.pop_front()

summary

deque and sortedlist Investigate