方法一:
class Solution { // O(nlgn), binary search
public:
int minSubArrayLen(int s, vector<int>& nums) {
vector<int> sum(nums);
for (int i = 1; i < nums.size(); ++i)
sum[i] += sum[i - 1];
int ret = 0;
for (int i = 0; i < nums.size(); ++i){
int low = 0, high = i;
while (low <= high){
int mid = (low + high) / 2;
if ( sum[i] - (mid ? sum[mid - 1] : 0) >= s){
ret = ret ? min (ret, i - mid + 1) : (i - mid + 1);
low = mid + 1;
}
else
high= mid - 1;
}
}
return ret ;
}
};
方法二:
class Solution { // O(n), two points
public:
int minSubArrayLen(int s, vector<int>& nums) {
int start = 0, ret = 0, sum = 0;
for (int i = 0; i < nums.size(); ++i){
sum += nums[i];
while (sum >= s){
ret = ret ? min (ret, i - start + 1) : i - start + 1;
sum -= nums[start++];
}
}
return ret;
}
};