-
Notifications
You must be signed in to change notification settings - Fork 0
/
4Sum.cpp
58 lines (54 loc) · 1.61 KB
/
4Sum.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
51
52
53
54
55
56
57
58
#include <vector>
#include <algorithm>
using namespace std;
class Solution {
public:
vector<vector<int>> fourSum(vector<int>& nums, int target)
{
vector<vector<int>> res;
int n = (int)nums.size();
sort(nums.begin(), nums.end());
for(int i = 0; i < n - 3; i++)
{
if(i > 0 && nums[i] == nums[i - 1])
{
continue;
}
for(int j = i + 1; j < n - 2;j++)
{
if(j > i + 1 && nums[j] == nums[j-1])
{
continue;
}
int left = j + 1;
int right = n - 1;
while(left < right)
{
int sum = nums[i] + nums[j] + nums[left] + nums[right];
if(sum == target)
{
vector<int> out{nums[i], nums[j], nums[left], nums[right]};
res.push_back(out);
while(left < right && nums[left] == nums[left + 1])
{
left++;
}
while(left < right && nums[right] == nums[right - 1])
{
right--;
}
left++;
right--;
}else if(sum < target)
{
++left;
}
else{
--right;
}
}
}
}
return res;
}
};