-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathThreeSum.java
More file actions
64 lines (57 loc) · 1.91 KB
/
Copy pathThreeSum.java
File metadata and controls
64 lines (57 loc) · 1.91 KB
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
package array;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.List;
/**
* Created by qiaoying on 2018/7/22.
*/
public class ThreeSum {
public static List<List<Integer>> threeSum(int[] nums) {
List<List<Integer>> result = new LinkedList<List<Integer>>();
if (nums != null && nums.length > 2){
Arrays.sort(nums);
for (int i = 0; i < nums.length - 2; ){
int j = i + 1;
int k = nums.length - 1;
while (j < k){
if (nums[j] + nums[k] == -nums[i]){
List<Integer> list = new ArrayList<Integer>(3);
list.add(nums[i]);
list.add(nums[j]);
list.add(nums[k]);
result.add(list);
k--;
j++;
while (j < k && nums[j] == nums[j - 1]){
j++;
}
while (j < k && nums[k] == nums[k + 1]){
k--;
}
}else if (nums[j] + nums[k] > -nums[i]){
k--;
while (j < k && nums[k] == nums[k + 1]){
k--;
}
}else {
j++;
while (j < k && nums[j] == nums[j - 1]){
j++;
}
}
}
i++;
while (i < nums.length - 2 && nums[i] == nums[i -1]){
i++;
}
}
}
return result;
}
public static void main(String[] args){
int[] a = {-1,0,1,2,-1,-4};
List<List<Integer>> b = threeSum(a);
System.out.println(b.size());
}
}