-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathintersection-of-two-arrays.go
61 lines (54 loc) · 1.09 KB
/
intersection-of-two-arrays.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
package main
import (
"fmt"
)
// source: https://leetcode.com/problems/intersection-of-two-arrays/
func intersection(nums1 []int, nums2 []int) []int {
m1, m2 := map[int]bool{}, map[int]bool{}
for _, i := range nums1 {
m1[i] = true
}
for _, i := range nums2 {
m2[i] = true
}
ans := make([]int, 0)
for i := range m1 {
if m2[i] {
ans = append(ans, i)
}
}
return ans
}
func main() {
testCases := []struct {
nums1 []int
nums2 []int
want []int
}{
{
nums1: []int{1, 2, 2, 1},
nums2: []int{2, 2},
want: []int{2},
},
{
nums1: []int{4, 9, 5},
nums2: []int{9, 4, 9, 8, 4},
want: []int{9, 4},
},
}
successes := 0
for _, tc := range testCases {
x := intersection(tc.nums1, tc.nums2)
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)
}
}