LeetCode 日记 209. 长度最小的子数组

class Solution {
    public int minSubArrayLen(int s, int[] nums) {
        if(nums.length == 0){
            return 0;
        }
        int left = 0,right = 0;
        int sum = 0;
        int len = nums.length;
        int min = len+1;
        while(right<len){   
            //窗口右移
               sum += nums[right++];
               //窗口左移
               while(left<right&&sum>=s){
                if(sum>=s){
                    min = Math.min(min,right-left);   
               } 
               sum -= nums[left++]; 
               }                
        }
        return min==len+1?0:min;
    }
}