LeetCode 209. Minimum length subarray

LeetCode 209. Subarray with the smallest length

The prefix and + Two points

class Solution {
    
public:
    int minSubArrayLen(int target, vector<int>& nums) {
    
        int n = nums.size();
        int s[n + 1] = {
    0};
        for(int i = 1; i <= n; i ++) s[i] = s[i - 1] + nums[i - 1];
        
        int res = 1e9;
        for(int i = 1; i <= n; i ++)
        {
    
            int t = s[i] - target;
            int l = 0, r = n;
            while(l < r)
            {
    
                int mid = (l + r + 1) >> 1;
                if(s[mid] <= t) l = mid;
                else r = mid - 1;
            }
            if(s[r] <= t) res = min(res, i - r);
        }
        return res == 1e9 ? 0 : res;
    }
};

The sliding window / Double pointer

class Solution {
    
public:
    int minSubArrayLen(int target, vector<int>& nums) {
    
        int sum = 0, res = 1e9;
        for(int l = 0, r = 0; r < nums.size(); r ++)
        {
    
            sum += nums[r];
            while(sum >= target)
            {
    
                res = min(res, r - l + 1);
                sum -= nums[l ++];
            }
        }
        return res == 1e9 ? 0 : res;
    }
};