[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)

Subscribe to see which companies asked this question

class Solution {
public:
    /*algorithm: two pointer
    */
    vector<vector<int>> fourSum(vector<int>& nums, int target) {
        vector<vector<int> >result;
        int n = nums.size();
        sort(nums.begin(),nums.end());
        for(int i = 0;i < n;i++){ //0,1,2,3
            for(int j=i+1;j < n;j++){
                int sum2 = nums[i] + nums[j];
                int l = j+1,h = n - 1;
                while(l < h){
                    int sum4 = sum2 + nums[l] + nums[h];
                    if(sum4 == target){
                        int A[]={nums[i],nums[j],nums[l],nums[h]};
                        result.push_back(vector<int>(A,A+4));
                        while((l+1)<h&&nums[l]==nums[l+1])++l;
                        while(h&&nums[h]==nums[h-1])--h;
                        ++l,--h;
                    }else if(sum4 < target)++l;
                    else h--;
                }
                while((j+1)<n&&nums[j]==nums[j+1])++j;
            }
            while((i+1)<n&&nums[i]==nums[i+1])++i;
        }
        return result;
    }
};