209. Minimum Size Subarray Sum

Question

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

For example, given the array [2,3,1,2,4,3] and s = 7,
the subarray [4,3] has the minimal length under the problem constraint.

click to show more practice.

More practice:
If you have figured out the O(n) solution, try coding another solution of which the time complexity is O(n log n).

思路

利用滑动窗口的思想，若元素之和 < s，窗口右边沿向右延伸，直到元素之和≥s 为止。若元素之和 ≥s，更新最小长度。然后窗口左边沿右移一位（即移除窗口中第一个元素），重复第1步。

代码

public class Solution {
    public int minSubArrayLen(int s, int[] nums) {

        int len = nums.length;
        if (len <= 0)
            return 0;
        int left = 0, right = -1, sum = 0, min = len + 10;
        while(right < len){
            while (sum < s){
                right++;
                if(right == len)
                    break;
                else
                    sum += nums[right];
            }
            if (sum >= s) {
                min = min < right - left + 1 ? min : right - left + 1;
                sum -= nums[left];
                left++;
            }
        }
        return min == len + 10 ? 0 : min;
    }
}

结果及分析

时间复杂度为O(n)，空间复杂度为O(1)；

二刷思路相同

public class Solution {
    public int minSubArrayLen(int s, int[] nums) {
        if(nums == null || nums.length == 0)
            return 0;
        int begain = 0,end = 0,minLen = Integer.MAX_VALUE,sum = 0;
        for(int i = 0;i < nums.length;i++){
            end = i;
            sum += nums[end];
            while(sum >= s){
                minLen = Math.min(minLen,end - begain + 1);
                sum -= nums[begain];
                begain++;
            }
        }

        return minLen == Integer.MAX_VALUE ? 0:minLen;
    }
}