# [leetcode] 209. Minimum Size Subarray Sum

Given an array of n positive integers and a positive integer s, find the minimal length of a subarray of which the sum ≥ s. If there isn't one, return 0 instead.

For example, given the array [2,3,1,2,4,3] and s = 7,
the subarray [4,3] has the minimal length under the problem constraint.

More practice:

If you have figured out the O(n) solution, try coding another solution of which the time complexity is O(n log n).

class Solution {
public:
int minSubArrayLen(int s, vector<int>& nums) {
if(nums.empty()) return 0;
int left =0, right =0, sum = 0, len = nums.size();
int res = len+1;

while(right<len){
while(sum<s && right<len){
sum += nums[right++];
}

while(sum>=s){
sum -= nums[left++];
res = min(res,right-left+1);
}
}

return res==len+1?0:res;

}
};

class Solution {
public:
int minSubArrayLen(int s, vector<int>& nums) {
if(nums.empty()) return 0;
int len = nums.size();
int res = len+1;

vector<int> sum(len+1,0);
for(int i=1; i<len+1; i++) sum[i] = sum[i-1]+nums[i-1];

for(int i=0; i<len+1; i++){
int right = searchRight(sum,i+1,len,sum[i]+s);
if(right==len+1) break;
if(res>right-i) res = right-i;
}

return res==len+1?0:res;

}

int searchRight(vector<int>& sum, int left, int right, int target){

while(left<=right){
int mid = (left+right)/2;
if(sum[mid]>=target) right = mid -1;
else left = mid+1;
}
return left;
}
};

05-12 6521

05-14 8538

05-04 895

06-13 595

01-25 469

05-19 250

01-08 1548

04-26 1145

03-06 4288

05-03 2496