restructure solutions dir
This commit is contained in:
parent
f9ddad5f88
commit
ccb8b5673b
10 changed files with 0 additions and 0 deletions
26
solutions/2/q209/solution.go
Normal file
26
solutions/2/q209/solution.go
Normal 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
|
||||
Loading…
Add table
Add a link
Reference in a new issue