-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path3sum
44 lines (41 loc) · 1.14 KB
/
3sum
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
import java.util.Arrays;
import java.util.*;
class Solution {
public List<List<Integer>> threeSum(int[] nums) {
Arrays.sort(nums);
List<List<Integer>>ans = new ArrayList<>();
Arrays.sort(nums);
for (int i = 0; i < nums.length - 2; i++)
{
if (i > 0 && nums[i] == nums[i - 1])
{
continue;
}
int l = i + 1;
int r = nums.length - 1;
while (l < r)
{
int p = nums[i] + nums[l] + nums[r];
if (p == 0)
{
ans.add(Arrays.asList(nums[i], nums[l], nums[r]));
while (l < r && nums[l] == nums[l + 1])
{
l++;
}
while (l < r && nums[r] == nums[r - 1])
{
r--;
}
l++;
r--;
} else if (p < 0) {
l++;
} else {
r--;
}
}
}
return ans;
}
}