-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathrun.go
51 lines (43 loc) · 757 Bytes
/
run.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 sum
import (
"sort"
)
func fourSum(nums []int, target int) [][]int {
var data [][]int
ln := len(nums)
if ln < 4 {
return data
}
sort.Ints(nums)
for i := 0; i < ln-3; i++ {
if i > 0 && nums[i-1] == nums[i] {
continue
}
for j := i + 1; j < ln-2; j++ {
if j > i+1 && nums[j-1] == nums[j] {
continue
}
s, e := j+1, ln-1
for s < e {
sum := nums[i] + nums[j] + nums[s] + nums[e]
if sum == target {
d := []int{nums[i], nums[j], nums[s], nums[e]}
data = append(data, d)
for s < e && nums[s] == nums[s+1] {
s++
}
for s < e && nums[e-1] == nums[e] {
e--
}
s++
e--
} else if sum < target {
s++
} else {
e--
}
}
}
}
return data
}