leetcode209. Minimum Size Subarray Sum

原创于 2017-06-22 22:15:40 发布 · 315 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #array

leetcode 同时被 2 个专栏收录

187 篇文章

订阅专栏

算法-Array

15 篇文章

订阅专栏

本文介绍了一种寻找给定数组中满足总和大于等于特定值的最小子数组长度的方法。通过一次遍历实现，适用于正整数数组。示例：对于数组[2,3,1,2,4,3]及目标值7，最短子数组为[4,3]。

209. 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.

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 Solution {
    public int minSubArrayLen(int s, int[] nums) {
        if (nums == null || nums.length == 0) {
            return 0;
        }

        int sum = 0, len = 0, minLen = Integer.MAX_VALUE;
        for (int i = 0; i < nums.length; i++) {
            sum += nums[i];
            len++;
            if (sum >= s) {
                if (len < minLen) {
                    minLen = len;
                }
                i = i - len + 1;
                len = 0;
                sum = 0;
            }
        }

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