LeetCode 209. Minimum Size Subarray Sum

class Solution {
public:
int minSubArrayLen(int s, vector<int>& nums) {
int mmin = numeric_limits<int>::max();
if(nums.size() ==0 ) return 0;

int start = -1,end = 0;
int sum = 0;
while(1){
if(start == nums.size()) break;
if(sum >= s)
{
int temp = start - end + 1;
mmin = mmin<temp?mmin:temp;
sum = sum - nums[end];
end++;
}
else
{
start++;
sum = sum + nums[start];
}
}
if(mmin == numeric_limits<int>::max())  return 0;
else    return mmin;
}
};