Minimum Size Subarray Sum

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

这题暴力的方法的n^2的复杂度，但是仔细想想，都是正数，如果从前往后加，sum[i+1] > sum[i],是肯定成立的。因此，对于前N个的和，他的起点肯定大于前N-1个数的起点。

class Solution {
public:
    int minSubArrayLen(int s, vector<int>& nums) {
        int sum = 0;
        int i = 0, min_len = INT_MAX;

        for(int j = 0; j < nums.size(); ++j)
        {
            sum += nums[j];
            while(sum>=s)
            {
                sum -= nums[i];
                min_len = min(min_len, j - i + 1);
                i++;
            }
        }

        return min_len == INT_MAX ? 0:min_len;
    }
};