长度最小的子数组

长度最小的子数组

class Solution {
    public int minSubArrayLen(int target, int[] nums) {
        int length = Integer.MAX_VALUE;
        int left = 0,right = 0;
        int sum = 0;
        while(right <= nums.length){
            if(target > sum){
                if(right == nums.length){
                    break;
                }
                // 0->1,target == nums[0],right = 1,left = 0
                //right = nums.length - 1,++,直接跳出了
                sum += nums[right];
                right++;
            }else if(sum >= target){
                length = Math.min(length,right - left);
                sum -= nums[left];
                left++;
            }
        }
        return length == Integer.MAX_VALUE ? 0 : length;
    }
}