地址:https://leetcode-cn.com/problems/4sum/
思路:通过遍历中间两个数,再通过两指针从数组两端开始搜索判断,同时注意对重复元素的判断
Code:
#include<iostream>
#include<algorithm>
#include<vector>
#include<unordered_map>
using namespace std;
class Solution {
public:
vector<vector<int>> fourSum(vector<int>& nums, int target) {
vector<vector<int>> res;
sort(nums.begin(),nums.end());
int n=nums.size();
int l,ll,r,p,xi,p1=0;
for(int i=1;i<n-2;++i)
{
ll=0;
if(i>1&&nums[i-1]==nums[i]){
if(p1||nums[0]==nums[i]){
continue;
}else ll=i-1,p1=1;
}else p1=0;
for(int j=i+1,pj=nums[j]-1;j<n-1;pj=nums[j],++j)
{
if(nums[j]==pj) continue;
l=ll; r=n-1;
while(l<i&&r>j){
p=target-nums[l]-nums[i]-nums[j]-nums[r];
if(p>0){
++l;
}else if(p<0){
--r;
}else{
res.push_back({nums[l],nums[i],nums[j],nums[r]});
xi=nums[l];
while(l<i&&nums[l]==xi){
++l;
}
xi=nums[r];
while(r>j&&nums[r]==xi){
--r;
}
}
}
}
}
return res;
}
};
int main()
{
int n,m,x;
vector<int> iv;
Solution So;
cin>>n>>m;
for(int i=0;i<n;++i)
{
cin>>x;
iv.push_back(x);
}
So.fourSum(iv,m);
return 0;
}