Leetcode 18. 四数之和

和Leetcode 15. 三数之和 类似……

class Solution {
public:
    vector<vector<int>> fourSum(vector<int>& nums, int target) {
        vector<int> tmp;
        vector<vector<int>> ans;
        sort(nums.begin(), nums.end());
        for (int first = 0; first + 3 < nums.size(); ++first) {
            if (first > 0 && nums[first] == nums[first - 1]) continue;
            for (int i = first + 1; i + 2 < nums.size(); ++i) {
                if (i >first + 1 && nums[i] == nums[i - 1]) continue;//跳过
                int l = i + 1, r = nums.size() - 1, sum = target - nums[i] - nums[first];//假定第一个元素
                while (l < r) {//找二元组，使第一个元素和二元组和为0
                    while (l<r && nums[r] + nums[l] > sum) --r;
                    if (l < r && nums[r] + nums[l] == sum) {//匹配的情况
                        tmp.clear();
                        tmp.push_back(nums[first]), tmp.push_back(nums[i]), tmp.push_back(nums[l]), tmp.push_back(nums[r]);
                        ans.push_back(tmp);
                    }
                    if (nums[l] == nums[r]) break;//跳过，注意要先加入答案集后再跳过
                    while (l < r && nums[l] == nums[l + 1]) ++l;
                    ++l;
                }
            }
        }
        return ans;
    }
};