/
find3ints0.cpp
46 lines (41 loc) · 1.17 KB
/
find3ints0.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
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <unordered_map>
using namespace std;
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums){
vector<vector<int>> ans;
if(nums.size()==0)return ans;
sort(nums.begin(),nums.end());
for(auto it: nums){
std::cout<<it<<", ";
}
for(int i=0;i<nums.size();i++){
if(i==0 || nums[i]!=nums[i-1]){
int j = i+1, k = nums.size()-1;
while(j<k){
int sumCurr = nums[i]+nums[j]+nums[k];
if(sumCurr==0){
std::vector<int> v{nums[i],nums[j],nums[k]};
ans.push_back(v);
while(j<k&&nums[j]==nums[j+1])j++;
while(j<k&&nums[k]==nums[k-1])k--;
j++;k--;
}
if(sumCurr>0)k--;
if(sumCurr<0) j++;
}
}
}
return ans;
}
};
int main(){
Solution s;
std::vector<int> v{-4,-4,-3,-2,-1,0,2};
vector<vector<int>> a =s.threeSum(v );
return 0;
}