-
Notifications
You must be signed in to change notification settings - Fork 11
/
Copy paththreeSum_test.go
51 lines (47 loc) · 991 Bytes
/
threeSum_test.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
package leet_code
import (
"fmt"
"sort"
"testing"
)
//三数之和
func TestThreeSum(t *testing.T) {
t.Log(threeSum([]int{-1, 0, 1, 2, -1, -4}))
}
func threeSum(nums []int) [][]int {
var (
result [][]int
numsMap = make(map[int]int, len(nums))
resultMap = make(map[string]string)
allIsZero = true
)
if len(nums) < 3 {
return result
}
sort.Ints(nums)
for i, v := range nums {
numsMap[v] = i
if v != 0 {
allIsZero = false
}
}
if allIsZero {
result = append(result, []int{0, 0, 0})
return result
}
for i, v := range nums {
for j := i + 1; j < len(nums); j++ {
if index, ok := numsMap[0-(v+nums[j])]; ok {
data := []int{v, nums[j], 0 - (v + nums[j])}
sort.Ints(data)
if _, ok := resultMap[fmt.Sprintf("%d_%d_%d", data[0], data[1], data[2])]; !ok {
if index != i && index != j {
result = append(result, data)
}
resultMap[fmt.Sprintf("%d_%d_%d", data[0], data[1], data[2])] = ""
}
}
}
}
return result
}