[leetcode] 18. 4Sum

Description

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]
]

Analysis

方法跟15. Sum3类似，只是要先固定前两个数字的位置i和j，然后从j后面进行front和back的两头逼近。
中间那几个while循环搞得我有点晕，不懂为啥注释掉的while循环会Memory Limit Exceeded，也许是数组下标越界？@_@

Code

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