MCPcopy Create free account
hub / github.com/betty200744/ultimate-go / SubarraySum

Function SubarraySum

leetcode/array/560_subarraySum/560_subarraySum.go:3–18  ·  view source on GitHub ↗
(nums []int, k int)

Source from the content-addressed store, hash-verified

1package _60_subarraySum
2
3func SubarraySum(nums []int, k int) int {
4 count := 0
5 for s := 0; s < len(nums); s++ {
6 for e := s + 1; e < len(nums); e++ {
7 sum := 0
8 for i := s; i < e; i++ {
9 sum += nums[i]
10 }
11 count++
12 if sum == k {
13 return count
14 }
15 }
16 }
17 return 0
18}

Callers 5

TestSubarraySumFunction · 0.85
TestSubarraySum2Function · 0.85
TestSubarraySum3Function · 0.85
TestSubarraySum4Function · 0.85
TestSubarraySum5Function · 0.85

Calls

no outgoing calls

Tested by 5

TestSubarraySumFunction · 0.68
TestSubarraySum2Function · 0.68
TestSubarraySum3Function · 0.68
TestSubarraySum4Function · 0.68
TestSubarraySum5Function · 0.68