LeetCode 209 Minimum Size Subarray Sum

题目描述

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.

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

---

分析

定义两个指针，st和ed。如果sum>=s，sum从前面元素开始减；如果sum< s，ed++。

---

代码

    public static int minSubArrayLen(int s, int[] nums) {

        int sum = 0;
        int st = 0;
        int min = Integer.MAX_VALUE;

        for (int i = 0; i < nums.length; i++) {

            sum += nums[i];

            if (sum >= s) {
                while (sum - nums[st] >= s) {
                    sum -= nums[st++];
                }
                min = Math.min(min, i - st + 1);
            }
        }

        if (min > nums.length) {
            return 0;
        }

        return min;
    }