怎么确定算法的时间复杂度
int minSubArrayLen(int s, int* nums, int numsSize){
int left = 0;
int right = 0;
int min = 0;
int sum = 0;
while (right < numsSize){
sum += nums[right];
right++;
while (sum >= s){
if (min == 0){
min = right - left;
}
else{
if(min > right - left)
min = right - left;
}
sum -= nums[left];
left++;
}
}
return min;
}