LeetCode刷题笔记(JAVA)——209. 长度最小的子数组（滑动窗口）

class Solution {
    public int minSubArrayLen(int target, int[] nums) {
        int minLength = Integer.MAX_VALUE;
        int length = nums.length;
        int sum = 0, start = 0, end = 0;
        if (length == 0) {
            return 0;
        }
        while (end < length) {
            sum += nums[end];
            while (sum >= target) {
                minLength = Math.min(minLength, end - start + 1);
                
                sum -= nums[start];
                ++start;
            }
            ++end;
        }
        return minLength == Integer.MAX_VALUE ? 0 : minLength;
    }
}

来源：LeetCode官方