class Solution {
public List<List<Integer>> threeSum(int[] nums) {
Arrays.sort(nums);
List<List<Integer>> output = new ArrayList<>();
for (int i = 0; i < nums.length - 2; i++) {
if (i == 0 || (i > 0 && nums[i] != nums[i - 1])) {
int target = -nums[i];
int j = i + 1;
int k = nums.length - 1;
while (j < k) {
int sum = nums[j] + nums[k];
if (sum == target) {
output.add(Arrays.asList(nums[i], nums[j], nums[k]));
while (j < k && nums[j] == nums[j + 1]) j++;
while (j < k && nums[k] == nums[k - 1]) k--;
j++;
k--;
} else if (sum < target) {
j++;
} else {
k--;
}
}
}
}
return output;
}
}
𝗢𝗽𝗲𝗻 𝘁𝗼 𝘂𝗽𝗱𝗮𝘁𝗲𝘀 𝗮𝗻𝗱 𝘀𝘂𝗴𝗴𝗲𝘀𝘁𝗶𝗼𝗻𝘀.
Top comments (0)