forked from DaleStudy/leetcode-study
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathhoyeongkwak.java
More file actions
32 lines (30 loc) · 1.02 KB
/
hoyeongkwak.java
File metadata and controls
32 lines (30 loc) · 1.02 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
/*
Time Complexity : O(n^2)
Space Complexity : O(1)
*/
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++) {
if (i > 0 && nums[i] == nums[i - 1]) continue;
int low = i + 1;
int high = nums.length - 1;
while (low < high) {
int threeSum = nums[i] + nums[low] + nums[high];
if (threeSum < 0) {
low = low + 1;
} else if (threeSum > 0) {
high = high - 1;
} else {
result.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 = low + 1;
high = high - 1;
}
}
}
return result;
}
}