具体方法是使用一个双端队列 dequedeque,在每次入队时,如果 dequedeque 队尾元素小于即将入队的元素 valuevalue,则将小于 valuevalue 的元素全部出队后,再将 valuevalue 入队;否则直接入队。
class MaxQueue {
Deque<Integer> max,res;
public MaxQueue() {
max=new LinkedList<>();
res=new LinkedList<>();
}
public int max_value() {
if(res.isEmpty()) return -1;
return max.peekFirst();
}
public void push_back(int value) {
res.addLast(value);
while(!max.isEmpty()&&max.peekLast()<value){
max.removeLast();
}
max.addLast(value);
}
public int pop_front() {
if(res.isEmpty()) return -1;
int temp=res.peekFirst();
if(temp==max.peekFirst()) max.removeFirst();
res.removeFirst();
return temp;
}
}
/**
* Your MaxQueue object will be instantiated and called as such:
* MaxQueue obj = new MaxQueue();
* int param_1 = obj.max_value();
* obj.push_back(value);
* int param_3 = obj.pop_front();
*/