[leetcode]-209. Minimum Size Subarray Sum（C语言）

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

Example: 

Input: s = 7, nums = [2,3,1,2,4,3]
Output: 2
Explanation: the subarray [4,3] has the minimal length under the problem constraint.

Follow up:

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

int minSubArrayLen(int s, int* nums, int numsSize) {
    if(numsSize==0)
        return 0;
    int i=0,j=-1,sum=0,len=numsSize+1;
    while(i<numsSize)
    {
        if(sum<s&&(j+1)<numsSize)
        {
            j++;
            sum+=nums[j];
        }
        else
        {
            sum-=nums[i];
            i++;
        }
        if(sum>=s&&(len>j-i+1))
            len=j-i+1;
    }
    if(len==numsSize+1)
        return 0;
    return len;
}