LeetCode/go/continuous-subarray-sum.go
Matej Focko d2ef757754
go: allow testing
Signed-off-by: Matej Focko <me@mfocko.xyz>
2024-06-16 11:44:08 +02:00

22 lines
357 B
Go

package main
func checkSubarraySum(nums []int, k int) bool {
first_index_of := make(map[int]int)
first_index_of[0] = -1
remainder := 0
for i, x := range nums {
remainder = (remainder + x) % k
j, seen := first_index_of[remainder]
if seen {
if i-j > 1 {
return true
}
} else {
first_index_of[remainder] = i
}
}
return false
}