add new solutions

This commit is contained in:
kanna5 2025-12-23 17:05:50 +09:00
parent 62ed89abcc
commit ed8cd12d25
2 changed files with 89 additions and 0 deletions

View file

@ -0,0 +1,26 @@
package q209
import "math"
func minSubArrayLen(target int, nums []int) int {
minLen := math.MaxInt
l, sum := 0, 0
for r := range nums {
sum += nums[r]
for l < r && sum-nums[l] >= target {
sum -= nums[l]
l++
}
if sum >= target {
minLen = min(minLen, r-l+1)
}
}
if minLen == math.MaxInt {
return 0
}
return minLen
}
var _ = minSubArrayLen