forked from DengWangBao/Leetcode-Java
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathThreeSum.java
37 lines (31 loc) · 950 Bytes
/
ThreeSum.java
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
import java.util.Arrays;
import java.util.LinkedList;
import java.util.List;
/**
* 这题重要的是查重
* 两重循环都要查重
*/
public class ThreeSum {
// 耗时30ms
public List<List<Integer>> threeSum(int[] nums) {
Arrays.sort(nums);
List<List<Integer>> result = new LinkedList<>();
for (int i = 0; i < nums.length; i++) {
if (i > 0 && nums[i] == nums[i - 1]) {
continue;
}
for (int j = i + 1, k = nums.length - 1; j < k; ) {
int sum = nums[i] + nums[j] + nums[k];
if (sum > 0) {
k--;
} else if (sum < 0) {
j++;
} else {
result.add(Arrays.asList(nums[i], nums[j], nums[k]));
for (j++, k--; j < k && nums[j] == nums[j - 1]; j++);
}
}
}
return result;
}
}