leetcode刷题笔记(Golang)--209. Minimum Size Subarray Sum

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.

Example:

Input: s = 7, nums = [2,3,1,2,4,3]
Output: 2
Explanation: the subarray [4,3] has the minimal length under the problem constraint.
Follow up:
If you have figured out the O(n) solution, try coding another solution of which the time complexity is O(n log n).

解题

func minSubArrayLen(s int, nums []int) int {
	l, r := 0, 0
	cumulate := 0
	res := math.MaxInt32
	for r < len(nums) {
		cumulate += nums[r]
		for cumulate >= s {
			if res > r-l+1 {
				res = r - l + 1
			}
			cumulate -= nums[l]
			l++
		}
		r++
	}
    if res == math.MaxInt32 {
        return 0
    }
	return res  
}