-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path4Sum.cpp
More file actions
65 lines (63 loc) · 1.88 KB
/
Copy path4Sum.cpp
File metadata and controls
65 lines (63 loc) · 1.88 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
class Solution
{
public:
vector<vector<int> > fourSum(vector<int> &num,int target)
{
if(num.empty())
return vector<vector<int> >();
sort(num.begin(),num.end());
vector<vector<int> > ret;
int n=num.size();
int i,j;
for(i=0; i<n-3; i++)
{
//只保留第一个不重复的,其余的都删了,因为left会选择重复的
if(i>=1&&num[i]==num[i-1])
continue;
for(j=n-1; j>i+2; j--)
{
//只保留最后一个不重复的,其余的都删了,因为right会选择重复的
if(j<n-1&&num[j+1]==num[j])
continue;
int left=i+1;
int right=j-1;
vector<int> tmp;
while(left<right)
{
//只保留最后一个不重复的,其余的都删了,因为left会选择重复的
if(right<j-1&&num[right]==num[right+1])
right--;
else if(num[i]+num[j]+num[left]+num[right]==target)
{
tmp= {num[i],num[left],num[right],num[j]};
ret.push_back(tmp);
left++;
right--;
}
else if(num[i]+num[j]+num[left]+num[right]<target)
left++;
else if(num[i]+num[j]+num[left]+num[right]>target)
right--;
}
}
}
return ret;
}
};
int main()
{
vector<int> vec= {-5,5,4,-3,0,0,4,-2};
Solution s;
vector<vector<int> > result=s.fourSum(vec,4);
for(auto a:result)
{
for(auto v:a)
cout<<v<<" ";
cout<<endl;
}
cout<<endl;
}