18. 4Sum
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]
]
题目链接:https://leetcode.com/problems/4sum/
解法
3sum外面再套一层循环,注意答案的去重。
这里去重的点:
在遇到和之前一样的元素时跳过 - 对子答案去重;
在遇到和下一个元素一样时跳过 - 子答案内不能使用一样的元素。
class Solution {
public:
vector<vector<int>> fourSum(vector<int>& nums, int target) {
vector<vector<int>> res;
if(nums.size()>=4){
sort(nums.begin(),nums.end());
for(int i=0;i<nums.size();++i){
if(i-1>=0 && nums[i]==nums[i-1]) continue;
cout<<i<<endl;
for(int j=i+1;j<nums.size();++j){
if(j-1>=i+1 && nums[j]==nums[j-1]) continue;
int left = j+1, right = nums.size()-1;
while(left<right){
int sum = nums[i]+nums[j]+nums[left]+nums[right];
if(target == sum){
vector<int> subres = {nums[i],nums[j],nums[left],nums[right]};
res.push_back(subres);
while(left<right && nums[left+1]==nums[left])left++;
while(right>left && nums[right-1]==nums[right]) right--;
left++;
right--;
}else if(target>sum)left++;
else right--;
}
}
}
}
return res;
}
};