Description
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]
]
Solution 1(C++)
class Solution {
public:
vector<vector<int>> fourSum(vector<int>& nums, int target) {
vector<vector<int>> res;
sort(nums.begin(), nums.end());
for(int i=0; i<nums.size(); i++){
if(i>0 && nums[i]==nums[i-1]) continue;
for(int j=i+1; j<nums.size(); j++){
if(j>i+1 && nums[j]==nums[j-1]) continue;
int l=j+1, r=nums.size()-1;
while(l<r){
int sum=nums[i]+nums[j]+nums[l]+nums[r];
if(sum>target) r--;
else if(sum<target) l++;
else{
res.push_back(vector<int>{nums[i],nums[j],nums[l],nums[r]});
while(nums[l]==nums[l+1]) l++;
while(nums[r]==nums[r-1]) r--;
l++; r--;
}
}
}
}
return res;
}
};
算法分析
类似的题目可以参考:
原理就不多说,注意这几道类似的题目即可。
程序分析
略。