Leecode 18. 四数之和

class Solution {
public:
    vector<vector<int>> fourSum(vector<int>& nums, int target) {
        vector<vector<int>> result;
        sort(nums.begin(),nums.end());
        for (int i = 0;i < nums.size();i++){
            //去重
            if (i > 0 && nums[i] == nums[i-1]) continue;
            for (int j = i+1;j < nums.size();j++){
                //去重
                if (j > i+1 && nums[j] == nums[j-1])   continue;
                int left = j+1;
                int right = nums.size()-1;
                while (right > left){
                    if ((long)nums[i] + nums[j] + nums[left] + nums[right] > target)  right--; 
                    else if ((long)nums[i] + nums[j] + nums[left] + nums[right] < target)  left++;
                    else    {
                        result.push_back(vector<int>{nums[i],nums[j],nums[left],nums[right]});
                        //去重
                        while (right > left && nums[right] == nums[right-1]) right--;
                        while (right > left && nums[left] == nums[left+1])   left++;
                        right--;
                        left++;
                    }
                }
            }
        }
        return result;
    }
};