-
Notifications
You must be signed in to change notification settings - Fork 6
/
Copy path3Sum.java
35 lines (33 loc) · 1.2 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
class Solution {
public List<List<Integer>> threeSum(int[] nums) {
List<List<Integer>> output = new LinkedList<>();
Arrays.sort(nums);
for(int i=0;i<nums.length-2;i++){
int low= i+1;
int high = nums.length-1;
int sum = 0 - nums[i];
if(i==0 || (i>0 && nums[i]!=nums[i-1])){
while(low < high){
if(nums[low] + nums[high] == sum){
output.add(Arrays.asList(nums[i],nums[low],nums[high]));
while((low < high) && nums[low] == nums[low+1])
{
low++;
}
while((low < high) && nums[high] ==nums[high -1]){
high--;
}
low++;
high--;
}
else if(nums[low]+nums[high] > sum){
high--;
}
else if(nums[low]+nums[high] < sum){
low++;
}
}
}
} return output;
}
}