-
Notifications
You must be signed in to change notification settings - Fork 0
/
3sum.java
69 lines (43 loc) · 1.01 KB
/
3sum.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
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
65
66
67
68
69
Leetoce 3 Sum Problem (Arrays)
class Solution {
public List<List<Integer>> threeSum(int[] nums) {
List<List<Integer>> result = new ArrayList<>();
Arrays.sort(nums);
for(int i=0;i<nums.length-2;i++)
{
//skip duplicates
if(i>0 && nums[i]==nums[i-1])
{
continue;
}
int left = i+1;
int right = nums.length-1;
while(left<right)
{
int sum = nums[i] + nums[left] + nums[right];
if(sum==0)
{
result.add(Arrays.asList(nums[i],nums[left],nums[right]));
while(left<right && nums[left]==nums[left+1])
{
left++;
}
while(left<right && nums[right]==nums[right-1])
{
right--;
}
left++;
right--;
}
else if(sum<0)
{
left++;
}
else{
right--;
}
}
}
return result;
}
}