LeetCode刷题【Array】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) {        int min = nums.length+1;        int sum=0;        int count=0;        for(int i=0;i<nums.length;i++){            sum+=nums[i];            count++;            if(sum>=s){                               while(sum>=s){                    min=count>min?min:count;                    sum=sum-nums[i-count+1];                    count--;                }            }        }        return min>nums.length?0:min;    }}

【参考】

https://leetcode.com/problems/minimum-size-subarray-sum/#/solution