Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]]
such that i != j
, i != k
, and j != k
, and nums[i] + nums[j] + nums[k] == 0
.
Notice that the solution set must not contain duplicate triplets.
Example 1:
Input: nums = [-1,0,1,2,-1,-4] Output: [[-1,-1,2],[-1,0,1]] Explanation: nums[0] + nums[1] + nums[2] = (-1) + 0 + 1 = 0. nums[1] + nums[2] + nums[4] = 0 + 1 + (-1) = 0. nums[0] + nums[3] + nums[4] = (-1) + 2 + (-1) = 0. The distinct triplets are [-1,0,1] and [-1,-1,2]. Notice that the order of the output and the order of the triplets does not matter.
Example 2:
Input: nums = [0,1,1] Output: [] Explanation: The only possible triplet does not sum up to 0.
Example 3:
Input: nums = [0,0,0] Output: [[0,0,0]] Explanation: The only possible triplet sums up to 0.
Constraints:
3 <= nums.length <= 3000
-105 <= nums[i] <= 105
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums) {
vector<vector<int>>result;
sort(nums.begin(),nums.end());
for(int i=0;i<nums.size();i++){
if(nums[i]>0)return result;
if(i>0 && nums[i]==nums[i-1])continue;
int left=i+1;
int right=nums.size()-1;
while(left<right){
if(nums[i]+nums[left]+nums[right]>0)right--;
else if(nums[i]+nums[left]+nums[right]<0)left++;
else {
result.push_back(vector<int>{nums[i],nums[left],nums[right]});
while(left<right && nums[right]==nums[right-1])right--;
while(left<right && nums[left]==nums[left+1])left++;
left++;
right--;
}
}
}
return result;
}
};
注意:
1.本题采用哈希法是不太恰当的,很难考虑全去重的条件,难以做到bug free
2.采用双指针,但是也有很多小细节
(1)首先需要对数组进行排序,才能用双指针的方法
(2)用i遍历一遍数组,nums[i]代表a,最终要求a+b+c=0
(3)内部再一次循环,循环条件是left<right,为什么left和right不能相等呢?因为当right=left的时候,b,c是同一个元素,而题目要求是不一样的三个数
i)如果三数之和大于0,right--;
ii)如果三数之和小于0,left++;
iii)else 将这三个数加入到result数组中,同时,我们需要在这里考虑去重操作,为什么不在前面判断呢?因为这样会漏掉三元组,需要先将符合条件的三元组加入到result中,再去重。
如果nums[right]==nums[right-1],right--;——注意,这里要用while
如果nums[left]==nums[left+1],left++;——注意,这里要用while
在做完之后,因为已经添加了一个三元组,并且已经去重,所以left++,right--;
(4)最后返回result即可。