Files
LeetCode-Go/leetcode/0209.Minimum-Size-Subarray-Sum/209. Minimum Size Subarray Sum.go
2021-06-04 00:37:02 +08:00

25 lines
359 B
Go

package leetcode
func minSubArrayLen(target int, nums []int) int {
left, sum, res := 0, 0, len(nums)+1
for right, v := range nums {
sum += v
for sum >= target {
res = min(res, right-left+1)
sum -= nums[left]
left++
}
}
if res == len(nums)+1 {
return 0
}
return res
}
func min(a int, b int) int {
if a > b {
return b
}
return a
}