leetcode-3.三数之和

给定一个包含 n 个整数的数组 nums，判断 nums 中是否存在三个元素 a，b，c ，使得 a + b + c = 0 ？找出所有满足条件且不重复的三元组。

注意：答案中不可以包含重复的三元组。

示例：

给定数组 nums = [-1, 0, 1, 2, -1, -4]，

满足要求的三元组集合为：
[
[-1, 0, 1],
[-1, -1, 2]
]

class Solution {
public:
    vector<vector<int>> twoSum(vector<int>& nums, int target, int left, int right) {
        int n = right - left + 1;
        vector<vector<int>> ret;
        
        if (n < 2) {
            return ret;
        }
        
        int start = nums[left -1];
        map<int, int> dc;
        
        for (int i = left; i <= right; i++) {
            int other = target - nums[i];
            if (dc.find(other) != dc.end()) {
                ret.push_back({start, other, nums[i]});
            }
            dc[nums[i]] = i;
        }
        
        return ret;
    }
    
    vector<vector<int>> threeSum(vector<int>& nums) {
        set<vector<int>> ret;
        int n = nums.size();
        if (n < 3) {
            return {};
        }
        
        sort(nums.begin(), nums.end()); // 排序nums
        
        for (int i = 0; i < n; i++) {
            if (nums[i] > 0) {
                break;
            }
            
            if ((i >= 1) && (nums[i] == nums[i-1])) {
                continue;
            }
            
            vector<vector<int>> tmp = twoSum(nums, 0 - nums[i], i+1, n-1);
            if (tmp.empty()) {
                continue;
            }
            
            ret.insert(tmp.begin(), tmp.end());
        }
        
        vector<vector<int>> ans(ret.begin(), ret.end());
        
        return ans;
    }
};