Given an array nums
of n integers, are there elements a, b, c in nums
such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.
Note:
The solution set must not contain duplicate triplets.
Example:
Given array nums = [-1, 0, 1, 2, -1, -4], A solution set is: [ [-1, 0, 1], [-1, -1, 2] ]
先排序,然后左右夹逼,复杂度 O(n2)。
这个方法可以推广到 k-sum ,先排序,然后做 k-2 次循环,在最内层循环左右夹逼,时间复杂度是 O(max{n log n, nk−1 })。
这个方法可以推广到 k-sum ,先排序,然后做 k-2 次循环,在最内层循环左右夹逼,时间复杂度是 O(max{n log n, nk−1 })。
class Solution {
public List<List<Integer>> threeSum(int[] nums) {
List<List<Integer>> res = new ArrayList<>();
if (nums == null || nums.length < 3)
return res;
Arrays.sort(nums);
int len = nums.length;
for (int i = 0; i <= len - 3; i++) {
int j = i + 1;
int k = len - 1;
while (j < k) {
if (nums[i] + nums[j] + nums[k] < 0) {
j++;
} else if (nums[i] + nums[j] + nums[k] >0)
k--;
else {
res.add(Arrays.asList(nums[i], nums[j], nums[k]));
j++;
k--;
while (j < k && nums[j] == nums[j - 1])
j++;
while (j < k && nums[k] == nums[k + 1])
k--;
}
}
while (i <= len - 3 && nums[i] == nums[i + 1])
i++;
}
return res;
}
}