LeetCode 862

非典型单调队列

class Solution {
    public int shortestSubarray(int[] nums, int k) {
        int n = nums.length;
        long[] s = new long[n + 1];
        for (int i = 1; i <= n; i++) s[i] = s[i - 1] + nums[i - 1];
        int res = Integer.MAX_VALUE;
        Deque<Integer> q = new LinkedList<>();
        q.offer(0);
        for (int i = 1; i <= n; i++) {
            while (!q.isEmpty() && s[q.peek()] + k <= s[i]) {
                res = Math.min(res,i - q.poll());
            }
            while (!q.isEmpty() && s[q.peekLast()] >= s[i]) q.pollLast();
            q.offer(i);
        }
        
        if (res == Integer.MAX_VALUE) res = -1;
        return res;
    }
}