[leetcode]209. Minimum Size Subarray Sum@Java解题报告

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/zjkC050818/article/details/79440008

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.

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.

Credits:
Special thanks to @Freezen for adding this problem and creating all test cases.

这道题可以使用滑动窗口的解法，很简洁，使用sum来记录之前的计算结果

package day0304.array;

/**
 * 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.
 * <p>
 * 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.
 */
public class P209_MinimumSizeSubarraySum {

    /*
    滑动窗口解法
     */
    public int minSubArrayLen(int s, int[] nums) {
        int l = 0, r = -1;//前闭后闭 如果r初始化为0的话，就包含了第一个元素
        int sum = 0;
        int res = nums.length + 1;

        while (l < nums.length) {

            if (r + 1 < nums.length && sum < s)
                sum += nums[++r];
            else//当r到右边界后，l会一直增加到边界值
                sum -= nums[l++];

            if (sum >= s)
                res = Math.min(res, r - l + 1);

        }

        if (res == nums.length + 1)
            return 0;

        return res;
    }
}