forked from LeBW/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathThreeSum.java
More file actions
53 lines (50 loc) · 1.69 KB
/
ThreeSum.java
File metadata and controls
53 lines (50 loc) · 1.69 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
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
/**
* @author LBW
*/
public class ThreeSum {
public List<List<Integer>> threeSum(int[] nums) {
Arrays.sort(nums);
List<List<Integer>> result = new ArrayList<>();
int len = nums.length;
for (int i = 0; i < len; i++) {
//skip repeated.
if (i > 0 && nums[i] == nums[i-1])
continue;
int num1 = nums[i];
int left = i + 1, right = len - 1;
while (left < right) {
if (nums[left] + nums[right] == -num1) {
result.add(Arrays.asList(num1, nums[left], nums[right]));
left++;
right--;
//skip repeated
while (left < right && nums[left] == nums[left-1])
left++;
while (left < right && nums[right] ==nums[right+1])
right--;
}
else if (nums[left] + nums[right] < -num1) {
left++;
//skip repeated
while (left < right && nums[left] == nums[left-1])
left++;
}
else {
right--;
//skip repeated
while (left < right && nums[right] ==nums[right+1])
right--;
}
}
}
return result;
}
public static void main(String[] args) {
ThreeSum threeSum = new ThreeSum();
List<List<Integer>> result = threeSum.threeSum(new int[]{-1, 0, 1, 2, -1, -4});
System.out.println(result);
}
}