【LeetCode】18. 4Sum

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

将4sum问题转化成3sum就好做了。

class Solution {
public:
    vector<vector<int>> fourSum(vector<int>& nums, int target) {
        int n = nums.size();
        int left,right;
        vector<vector<int>> res;
        sort(nums.begin(),nums.end());
        if(nums.size()<4) return res;
        
        for(int i=0;i<n-3;i++){
            if(nums[i]==nums[i-1]&&i>0) continue;
            if(nums[i]+nums[i+1]+nums[i+2]+nums[i+3] > target) break;
            if(nums[i]+nums[n-3]+nums[n-2]+nums[n-1] < target) continue;
            
            for(int j=i+1;j<n-2;j++){
                if(j>i+1 && nums[j]==nums[j-1]) continue;
                if(nums[i]+nums[j]+nums[j+1]+nums[j+2] > target) break;
                if(nums[i]+nums[j]+nums[n-2]+nums[n-1] < target) continue;
               
                
                left = j+1;
                right = n-1;
                while(left<right){
                    if(nums[i]+nums[j]+nums[left]+nums[right] > target) right--;
                    else if(nums[i]+nums[j]+nums[left]+nums[right] < target) left++;//少写一个else 就出错
                    else{
                        res.push_back({nums[i],nums[j],nums[left],nums[right]});
                        do{left++;} while(nums[left]==nums[left-1] && left<right); 
                        do{right--;} while(nums[right]==nums[right+1] && right>left); 
                    }
                }
                
            }
        }
        return res;
    }
};