題目:
https://leetcode.com/problems/minimum-size-subarray-sum/
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
| #define INF 0x3f3f3f3f
class Solution {
public:
int minSubArrayLen(int target, vector<int>& nums) {
int ans = INF;
for(int l=0, r=0, sum=0; r < nums.size(); ++r){
sum += nums[r];
while(sum - nums[l] >= target){
sum -= nums[l++];
}
if(sum >= target) ans = min(ans, r-l+1);
}
return ans == INF ? 0 : ans;
}
};
|
