剑指 Offer 59 - II. 队列的最大值

请定义一个队列并实现函数 max_value 得到队列里的最大值，要求函数max_value、push_back 和 pop_front 的均摊时间复杂度都是O(1)。

若队列为空，pop_front 和 max_value 需要返回 -1

示例 1：

输入: 
["MaxQueue","push_back","push_back","max_value","pop_front","max_value"]
[[],[1],[2],[],[],[]]
输出: [null,null,null,2,1,2]
示例 2：

输入: 
["MaxQueue","pop_front","max_value"]
[[],[],[]]
输出: [null,-1,-1]
 

限制：

1 <= push_back,pop_front,max_value的总操作数 <= 10000
1 <= value <= 10^5

解题思路：开辟数组存放队列值，最大值用双端队列记录，方法同上一题。

class MaxQueue {
    int front = 0;
    int back = 0;
    Deque<Integer> max = new LinkedList<Integer>();
    int[] queue;
    public MaxQueue() {
        queue = new int[10000];
    }
    
    public int max_value() {
        if(front == back) return -1;
        return queue[max.peekFirst()];
    }
    
    public void push_back(int value) {
        queue[back] = value;
        back++;
        while(!max.isEmpty() && value >= queue[max.peekLast()]){
            max.pollLast();
        }
        max.offerLast(back - 1);
    }
    
    public int pop_front() {
        if(back == front) return -1;
        else{
            if(front == max.peekFirst())
                max.pollFirst();
            front++;
            return queue[front - 1];
        }
    }
}
/**
 * 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();
 */