leetcode18、四数之和

给你一个由 n 个整数组成的数组 nums ，和一个目标值 target 。请你找出并返回满足下述全部条件且不重复的四元组 [nums[a], nums[b], nums[c], nums[d]] （若两个四元组元素一一对应，则认为两个四元组重复）：

• 0 <= a, b, c, d < n
• a、b、c 和 d 互不相同
• nums[a] + nums[b] + nums[c] + nums[d] == target

你可以按 任意顺序 返回答案 。

示例 1：

输入：nums = [1,0,-1,0,-2,2], target = 0
输出：[[-2,-1,1,2],[-2,0,0,2],[-1,0,0,1]]

示例 2：

输入：nums = [2,2,2,2,2], target = 8
输出：[[2,2,2,2]]

提示：

• 1 <= nums.length <= 200
• -109 <= nums[i] <= 109
• -109 <= target <= 109

class Solution {
private:
    vector<int> buffer = {};
    vector<vector<int>> res = {};
public:
    void twoSum(vector<int>& nums, long long target, int start){
        int left = start;
        int right = nums.size()-1;
        while (left < right) {
            if (nums[left] + nums[right] < target) left++;
            else if (nums[left] + nums[right] > target) right--;
            else {
                buffer.push_back(nums[left]);
                buffer.push_back(nums[right]);
                res.push_back(buffer);
                buffer.pop_back();
                buffer.pop_back();
                do{left++;}while (nums[left] == nums[left-1] && left < right);
                do{right--;}while (nums[right] == nums[right+1] && left < right);
            }
        }
        return;
    }
    void nSum(vector<int>& nums, long long target, int start, int n){
        if(n == 2) twoSum(nums, target ,start);
        else {
            for (int i = start; i < nums.size() - n + 1; i++)
            {
                buffer.push_back(nums[i]);
                nSum(nums , target - nums[i], i+1, n-1);
                buffer.pop_back();
                while (i < nums.size() - n && nums[i] == nums[i+1]) i++;
            }
        }
        return;
    }
    vector<vector<int>> fourSum(vector<int>& nums, int target) {
        sort(nums.begin(), nums.end());
        if (nums.size() < 4) return {};
        nSum(nums, target, 0, 4);
        return res;
    }
};

 

60 ms 72.14%

13.5 MB 7.48%