18. 4Sum

题目

Given an array S of n integers, are there elements a, b, c, and d in S 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.

For example, given array S = [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 Closest、3Sum同属于K-Sum类型的题目。思路都一样，就是固定其中k-2个数，遍历剩余的两个数的组合，利用排序将时间复杂度降低，思路都差不多，在此不赘述了

代码

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

            }
            }
        }
        set<vector<int>>::iterator itr = result.begin();
        for(;itr!=result.end();itr++)
        {
            res.push_back(*itr);
        }
        return res;  

    }
};