leetcode_minimum_size_subarray_sum

class Solution {
public:
    int minSubArrayLen(int s, vector<int>& nums) {
        int sum = 0;
        int start = 0;
        int minimum = 0;
        for(int i = 0; i < nums.size(); i++)
        {
            sum+=nums[i];
            if(sum >= s)
            {
                while((sum-nums[start]) >= s)
                {
                    sum -= nums[start];
                    start++;
                }
                if(minimum == 0)
                    minimum = i-start+1;
                else
                    minimum = min(minimum, i-start+1);
            }
        }
        return minimum;
    }
};