leetcode209. Minimum Size Subarray Sum(滑动窗口)

题目描述

Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum ≥ s. If there isn’t one, return 0 instead.

Example:

Input: s = 7, nums = [2,3,1,2,4,3]
Output: 2
Explanation: the subarray [4,3] has the minimal length under the problem constraint.

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/minimum-size-subarray-sum
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

代码

优化的暴力法

#include <iostream>
#include <cassert>
#include <vector>

using namespace std;


// Brute Force + Greedy
// Time Complexity: O(n^2)
// Space Complexity: O(1)
class Solution {
public:
    int minSubArrayLen(int s, vector<int>& nums) {

        assert(s > 0);

        int res = nums.size() + 1;
        for(int l = 0 ; l < nums.size() ; l ++) {
            int sum = 0;
            for (int r = l; r < nums.size(); r++){
                sum += nums[r];
                if(sum >= s){
                    res = min(res, r - l + 1);
                    break;
                }
            }
        }

        return res == nums.size() + 1 ? 0 : res;
    }
};


int main() {

    vector<int> nums1 = {2, 3, 1, 2, 4, 3};
    int s1 = 7;
    cout << Solution().minSubArrayLen(s1, vec1) << endl;

    return 0;
}

思路二

前缀和+二分搜索

#include <iostream>
#include <cassert>
#include <vector>
#include <algorithm>

using namespace std;


// Sum Prefix + Binary Search
// Time Complexity: O(nlogn)
// Space Complexity: O(n)
class Solution {
public:
    int minSubArrayLen(int s, vector<int>& nums) {

        assert(s > 0);

        vector<int> sums(nums.size() + 1, 0);
        for(int i = 1 ; i <= nums.size() ; i ++)
            sums[i] = sums[i-1] + nums[i-1];

        int res = nums.size() + 1;
        for(int l = 0; l < (int)nums.size(); l ++){
            auto r_bound = lower_bound(sums.begin(), sums.end(), sums[l] + s);
            if(r_bound != sums.end()){
                int r = r_bound - sums.begin();
                res = min(res, r - l);
            }
        }

        return res == nums.size() + 1 ? 0 : res;
    }
};

int main() {

    vector<int> nums1 = {2, 3, 1, 2, 4, 3};
    int s1 = 7;
    cout << Solution().minSubArrayLen(s1, nums1) << endl;
    // 2

    // ---

    vector<int> nums2 = {};
    int s2 = 100;
    cout << Solution().minSubArrayLen(s2, nums2) << endl;

    return 0;
}

思路三

滑动窗口。
想象一下，在一个坐标上存在两个指针begin 和i ，begin 代表滑窗的左边框，i代表滑窗的右边框。两者通过分别向右滑动，前者能使窗口之间的和减小，后者能使窗口之间的和增大。开始时二者重合，窗口的和就是重合点所在的数。

开始i向右滑动，使和变大。
当恰好大于等于s时，记录滑窗所包括的子数组长度ans，若ans已有数值，需判断新值是否小于旧值，若是，更新ans。begin向右滑动
判断是否仍大于等于s。
若是，重复步骤2，3。若否，转步骤1。直到右边框到达最右边。

#include <iostream>
#include <cassert>
#include <vector>

using namespace std;


// Sliding Window
// Time Complexity: O(n)
// Space Complexity: O(1)
class Solution {
public:
    int minSubArrayLen(int s, vector<int>& nums) {

        assert(s > 0);

        int l = 0 , r = -1; // sliding window: nums[l...r]
        int sum = 0;
        int res = nums.size() + 1;

        while(l < nums.size()){

            if(r + 1 < nums.size() && sum < s)//避免r+1超出边界
                sum += nums[++r];
            else
                sum -= nums[l++];

            if(sum >= s)
                res = min(res, r - l + 1);//当前连续子数组元素个数为r-l+1
        }

        return res == nums.size() + 1 ? 0 : res;//若无解return 0
    }
};


int main() {

    vector<int> nums1 = {2, 3, 1, 2, 4, 3};
    int s1 = 7;
    cout << Solution().minSubArrayLen(s1, nums1) << endl;

    return 0;
}