LeetCode - 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)
class Solution {
public:
    vector<vector<int> > fourSum(vector<int> &num, int target) {
        set<vector<int> >result;
        vector<vector<int> > vec;
        vector<int> tmp;
        
        if(num.empty()||num.size()<3){
            return vec;
        }
        sort(num.begin(),num.end());
        int sum=0,j,k;
        for(int n=0;n<num.size()-3;n++){
            for(int i=n+1;i<num.size()-2;i++){
                j=i+1;
                k=num.size()-1;
                while(j<k){
                    sum=num[n]+num[i]+num[j]+num[k];
                    if(sum==target){ 
                        tmp.clear();
                        tmp.push_back(num[n]);
                        tmp.push_back(num[i]); 
                        tmp.push_back(num[j]);  
                        tmp.push_back(num[k]);  
                        result.insert(tmp);
                        j++;
                        k--;
                    }else if(sum<target){
                        j++;
                    }else{
                        k--;
                    }
                }
            }
        }
        
        vec.assign(result.begin(),result.end());
        return vec;
    }
};