[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.

click to show more practice.

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;
        
    }
};

解法二：

建立一个sum，每一个sum[i]表示num[0,i-1]的和。那么从每一个数字num[i]，在sum[i+1,end]找到第一个比num[i]+s还大的数，就是从num[i]开始和大于s的最小区间。

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;
    }
};