-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path4Sum.cpp
More file actions
52 lines (51 loc) · 978 Bytes
/
Copy path4Sum.cpp
File metadata and controls
52 lines (51 loc) · 978 Bytes
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
#include <vector>
#include <set>
#include <map>
#include <utility>
#include <algorithm>
using namespace std;
class Solution {
public:
vector<vector<int>> fourSum(vector<int>& nums, int target) {
sort(nums.begin(), nums.end());
vector<vector<int> > ans;
vector<int> rec(4);
for(int i=0; i<nums.size(); ++i){
int a = nums[i];
for(int j=i+1; j<nums.size(); ++j){
int b = nums[j];
int lb = j+1;
int ub = (int)nums.size() - 1;
while(lb<ub){
int val = a+b+nums[lb]+nums[ub];
if(val == target){
rec[0] = a;
rec[1] = b;
rec[2] = nums[lb];
rec[3] = nums[ub];
ans.push_back(rec);
while(lb < ub){
if(nums[lb+1]==nums[lb])
++lb;
else
break;
}
++lb;
while(lb < ub){
if(nums[ub-1]==nums[ub])
--ub;
else
break;
}
--ub;
}else if(val > target){
--ub;
}else{
++lb;
}
}
}
}
return ans;
}
};