209. Minimum Size Subarray Sum 

 1 class Solution {
 2     public int minSubArrayLen(int s, int[] nums) {
 3         if(nums.length == 0) return 0;
 4         int count = 0;
 5         int i = 0, j = 0;
 6         int min = Integer.MAX_VALUE;
 7         while(j < nums.length){
 8             count += nums[j++];
 9             while(count > s){
10                 min = Math.min(min, j - i);
11                 count -= nums[i++];
12             }
13             if(count == s){
14                 min = Math.min(min, j - i);
15             }
16         }
17         if(min == Integer.MAX_VALUE){
18             return 0;
19         }else{
20             return min;
21         }
22         
23         
24     }
25 }

 

posted @ 2018-11-01 05:38  jasoncool1  阅读(131)  评论(0)  编辑  收藏  举报