-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path3sum.go
48 lines (34 loc) · 1.04 KB
/
3sum.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
package main
import "sort"
func threeSum(nums []int) [][]int {
count := len(nums)
result := [][]int{}
sort.Ints(nums)
for i := 0; i < count-2; i++ {
if nums[i] > 0 {
break
}
if i > 0 && nums[i] == nums[i-1] {
continue
}
for left,right := i+1,count-1; left < right; {
sum := nums[i] + nums[left] + nums[right]
if sum == 0 {
result = append(result, []int{ nums[i], nums[left], nums[right]})
for ;left < right && nums[left] == nums[left+1]; {
left++
}
for ;right > left && nums[right] == nums[right-1] ; {
right--
}
right--
left++
} else if sum > 0 {
right--
} else {
left++
}
}
}
return result
}