-
Notifications
You must be signed in to change notification settings - Fork 0
/
18.cpp
50 lines (48 loc) · 1.47 KB
/
18.cpp
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
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
class Solution {
public:
vector<vector<int>> fourSum(vector<int>& nums, int target) {
sort(nums.begin(), nums.end());
vector<vector<int>> ans;
int n = nums.size();
for(int i =0;i<n; ++i){
if(i > 0 && nums[i] == nums[i-1]) continue;
for(int j = i+1 ; j < n; ++j){
if(j != i + 1 && nums[j] == nums[j-1] ) continue;
int k = j+1;
int l = n-1;
while(k < l){
vector<int> vec;
long long sum = 0;
sum += nums[i];
sum += nums[j];
sum += nums[k];
sum += nums[l];
if( sum == target){
vec.pb(nums[i]);
vec.pb(nums[j]);
vec.pb(nums[k]);
vec.pb(nums[l]);
ans.pb(vec);
k++;
l--;
while(k < l && nums[k] == nums[k-1]) k++;
while(k < l && nums[l] == nums[l+1]) l--;
}
if(sum > target){
l--;
}
else if(sum < target){
k++;
}
}
}
}
return ans;
}
};
int main(){
return 0;
}