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.

class Solution {
public:
    int minSubArrayLen(int s, vector<int>& nums) {
        int sum  = 0, start = 0, end = 0, res = nums.size() + 1;
        while( end < nums.size() ) {

            while( sum < s && end < nums.size() ) {
                sum += nums[end++];
            }
            while(sum >= s && start <= end){
                res = min(res, end - start);
                sum -= nums[start++];
            }
        }
        return res == nums.size() + 1 ? 0 : res;
    }
};