class MaxQueue {
// 维护一个非严格单调递减的双端队列。记录队列最大值
Deque<Integer> markmax;
Queue<Integer> queue;
public MaxQueue() {
markmax=new LinkedList();
queue=new LinkedList();
}
public int max_value() {
if(queue.size()==0){
return -1;
}
return markmax.peekFirst();
}
public void push_back(int value) {
queue.offer(value);
while(markmax.size()!=0&&markmax.peekLast()<value){
markmax.pollLast();
}
markmax.offerLast(value);
}
public int pop_front() {
if(queue.size()==0){
return -1;
}
int res= queue.poll();
if(res==markmax.peekFirst()){
markmax.pollFirst();
}
return res;
}
}
/**
* 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();
*/