[LeetCode] 18. 4Sum

4Sum

Given an array nums of n integers and an integer target, are there elements a, b, c, and d in nums such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.
Note:
The solution set must not contain duplicate quadruplets.
Example:

Given array nums = [1, 0, -1, 0, -2, 2], and target = 0.
A solution set is:
[
[-1, 0, 0, 1],
[-2, -1, 1, 2],
[-2, 0, 0, 2]
]

解析

类似于3Sum的解法，就是4Sum在外面多了一层循环。并且在两次for循环进行判重。

class Solution {
public:
    vector<vector<int>> fourSum(vector<int>& nums, int target) {
        int size = nums.size();
        if(size<4) return {};
        vector<vector<int> > res;
        sort(nums.begin(),nums.end());
        for(int i =0;i<size-3;i++){
            if(i>0 && nums[i]==nums[i-1])
                continue;
            for(int j=i+1;j<size-2;j++){
                if(j>i+1 && nums[j]==nums[j-1])
                    continue;
                int left = j+1,right = size-1;
                while(left<right){
                    int sum = nums[i]+nums[j]+nums[left]+nums[right];
                    if(sum == target){
                        res.push_back({nums[i],nums[j],nums[left],nums[right]});
                        while(left<right && nums[left+1]==nums[left]) left++;
                        while(left<right && nums[right]==nums[right-1]) right--;
                        left++;right--;
                    }
                    else if(sum < target)
                        left++;
                    else
                        right--;
                }
            }
        }
        return res;
    }
};

参考

https://www.cnblogs.com/grandyang/p/4515925.html