题目描述：力扣

解题思路：

题目本身有错误，无法同时满足O（1）

作者：cescesces 链接：https://leetcode-cn.com/problems/dui-lie-de-zui-da-zhi-lcof/solution/javadan-shu-zu-by-cescesces/ 

class MaxQueue {

    private List<Integer> queue;
    private int i,curr,max;
    public MaxQueue() {
        i = 0;
        curr= -1;
        queue = new ArrayList<>();
        max = -1;
    }

    public int max_value() {
        if(max == -1 || max >= queue.size()){
            return -1;
        }
        return queue.get(max);
    }

    public void push_back(int value) {
        ++curr;
        queue.add(value);
        if(max == -1){
            max = curr;
        }
        if(queue.get(max) <= value){
            max = curr;
        }
    }

    public int pop_front() {
        if(queue.isEmpty() || i >= queue.size()){
            return -1;
        }
        int first = queue.get(i);
        if(i == max){
            int j = ++i;
            ++max;
            while(j < queue.size()){
                max = queue.get(max) <= queue.get(j) ? j : max;
                ++j;
            }
        } else {
            ++i;
        }
        return first;
    }
}

/**
 * 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();
 */