18. 4Sum
Medium
936190FavoriteShare
Given an array nums
of n integers and an integer target
, are there elements a, b, c, and d in nums
such that a + b + c + d = target
? Find all unique quadruplets in the array which gives the sum of target
.
Note:
The solution set must not contain duplicate quadruplets.
Example:
Given array nums = [1, 0, -1, 0, -2, 2], and target = 0. A solution set is: [ [-1, 0, 0, 1], [-2, -1, 1, 2], [-2, 0, 0, 2] ]
这道题和3sum很相似,但在写的时候有几点特别需要注意,我在下面AC代码中标注出来。都是AC时会出错的地方:
class Solution {
public:
vector<vector<int>> fourSum(vector<int>& nums, int target) {
vector<int> anss;
anss.clear();
vector<vector<int>> ans;
ans.clear();
sort(nums.begin(),nums.end());
if(nums.size()<4)return ans;
for(int i=0;i<nums.size()-3;i++)
{
for(int j=i+1;j<nums.size()-2;j++)
{
int k=j+1;
int p=nums.size()-1;
int t=target-nums[i]-nums[j];
while(k<p)
{
if(nums[k]+nums[p]==t)
{
anss.clear();
anss.push_back(nums[i]);
anss.push_back(nums[j]);
anss.push_back(nums[k]);
anss.push_back(nums[p]);
ans.push_back(anss);
p--;//这里p--和k++如果漏了,就死循环了,非常非常重要
k++;
while(p>j+1&&nums[p]==nums[p+1])p--;//下面4个while,如果不加会有冗余答案出现。但是在写这句时,一开始我没有带p>j+1这个条件,下面也是一样,一开始没有写k<nums.size()-2。在特殊testcase[0,0,0,0]0时,会出错,因为这里指针一直增大或减小。
while(k<nums.size()-2&&nums[k]==nums[k-1])k++;
}
else if(nums[k]+nums[p]>t)p--;
else k++;
}
while((j<nums.size()-1)&&nums[j+1]==nums[j])j++;//此处同上
}
while((i<nums.size()-2)&&nums[i+1]==nums[i])i++;//此处同上
}
return ans;
}
};