Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- class Solution {
- struct vc_hash{
- int operator () (const vector<int>& x) const {
- int res = 0;
- for(int y : x) res ^= y;
- return res;
- }
- };
- public:
- vector<vector<int>> threeSum(vector<int>& nums) {
- unordered_set<vector<int>, vc_hash> st;
- unordered_set<int> vis;
- for(int i = 0 ; i < (int)nums.size() ; i++){
- for(int j = i + 1 ; j < (int)nums.size() ; j++){
- if(vis.find(-nums[i] - nums[j]) != vis.end())
- st.insert({nums[i], nums[j], -nums[i] - nums[j]});
- }
- vis.insert(nums[i]);
- }
- return vector<vector<int>>(st.begin(), st.end());
- }
- };
- int main(){
- return 0;
- }
Add Comment
Please, Sign In to add comment