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] ]
我的解法:
把3sum简化为n个2sum问题。选择一个数,然后从它后面使用双指针检索。这道题最难的地方是需要注意去除重复的情况。具体操作为计算到该数时,要判断它和前面一个数是否相同,如果相同,该轮循环直接跳过。
class Solution {
public List<List<Integer>> threeSum(int[] nums) {
List<List<Integer>> res = new ArrayList<List<Integer>>();
Arrays.sort(nums);
for(int i=1;i<=nums.length-2;i++){
//从头到尾搜索
int temp = 0-nums[i-1];
int start = i;
int end = nums.length-1;
if(i-1>0 && start<end && nums[i-1]==nums[i-2])continue;
while(start<end){
//双指针搜索
if(temp == nums[start]+nums[end]){
//相等,找到
List<Integer> inner = new ArrayList<Integer>();
inner.add(nums[i-1]);
inner.add(nums[start]);
inner.add(nums[end]);
res.add(inner);
while(start<end && nums[start]==nums[start+1])start++;
while(start<end && nums[end]==nums[end-1])end--;
start++;
end--;
}else if(temp < nums[start]+nums[end]){
end--;
}else if(temp > nums[start]+nums[end]){
start++;
}
}
}
return res;
}
}