-
Notifications
You must be signed in to change notification settings - Fork 0
/
3Sum
42 lines (39 loc) · 1.18 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
class Solution {
public List<List<Integer>> threeSum(int[] nums) {
List<List<Integer>> res = new ArrayList<List<Integer>>();
if(nums == null || nums.length<3)
return res;
Arrays.sort(nums);
for(int i = 0; i<nums.length-2; i++)
{
if(i == 0 || nums[i] > nums[i-1]){
int j = i+1;
int k = nums.length-1;
while(j<k)
{
if(nums[i]+nums[j]+nums[k] == 0)
{
List<Integer> l = new ArrayList<>();
l.add(nums[i]);
l.add(nums[j]);
l.add(nums[k]);
res.add(l);
j++;
k--;
while(j<k && nums[j] == nums[j-1])
j++;
while(j<k && nums[k] == nums[k+1])
k--;
}
else if(nums[i]+nums[j]+nums[k]<0)
{
j++;
}
else
k--;
}
}
}
return res;
}
}