-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathleft-and-right-sum-differences.go
65 lines (55 loc) · 1.13 KB
/
left-and-right-sum-differences.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
package main
import (
"fmt"
)
// source: https://leetcode.com/problems/left-and-right-sum-differences/
func abs(x int) int {
if x < 0 {
return -x
}
return x
}
func leftRigthDifference(nums []int) []int {
n := len(nums)
ans, lsum, rsum := make([]int, n), make([]int, n), make([]int, n)
for i := 1; i < n; i++ {
lsum[i] = lsum[i-1] + nums[i-1]
}
for i := n - 2; i >= 0; i-- {
rsum[i] = rsum[i+1] + nums[i+1]
}
for i := range lsum {
ans[i] = abs(lsum[i] - rsum[i])
}
return ans
}
func main() {
testCases := []struct {
nums []int
want []int
}{
{
nums: []int{10, 4, 8, 3},
want: []int{15, 1, 11, 22},
},
{
nums: []int{1},
want: []int{0},
},
}
successes := 0
for _, tc := range testCases {
x := leftRigthDifference(tc.nums)
status := "ERROR"
if fmt.Sprint(x) == fmt.Sprint(tc.want) {
status = "OK"
successes++
}
fmt.Println(status, " Expected: ", tc.want, " Actual: ", x)
}
if l := len(testCases); successes == len(testCases) {
fmt.Printf("===\nSUCCESS: %d of %d tests ended successfully\n", successes, l)
} else {
fmt.Printf("===\nFAIL: %d tests failed\n", l-successes)
}
}