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:

• Elements in a quadruplet (a,b,c,d) must be in non-descending order. (ie, a ≤ b ≤ c ≤ d)
• 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)

没啥特别的，就是用set去重可以说说吧。。。复杂度还是n3

class Solution {
public:
    vector<vector<int> > fourSum(vector<int> &num, int target) {
        sort(num.begin(),num.end());
        set<vector<int>> result;
        int i=0,j=num.size()-1;
        for(int i=0;i<num.size();i++)
            for(int j=num.size()-1;j>i;j--){
                int sum=target-num[i]-num[j];
                int m=i+1,n=j-1;
                while(m<n){
                    if(num[m]+num[n]>sum) n--;
                    else if(num[m]+num[n]<sum) m++;
                    else{
                        vector<int> temp;
                        temp.push_back(num[i]);
                        temp.push_back(num[m]);
                        temp.push_back(num[n]);
                        temp.push_back(num[j]);
                        result.insert(temp);
                        m++;
                }
            }
        }
        vector<vector<int>> ans;
        copy(result.begin(),result.end(),back_inserter(ans));
        return ans;
    }
};