10 int start = 0, end = 0, current_sum = nums[0], minimal_size = 0;
11 while (start < (
int)nums.size() && end < (
int)nums.size())
15 if (current_sum >= target)
17 if (minimal_size == 0)
18 minimal_size = end - start + 1;
20 minimal_size = min(minimal_size, end - start + 1);
23 current_sum -= nums[start];
29 if (end < (
int)nums.size())
30 current_sum += nums[end];