Leetcode 18. 4Sum (Medium) (cpp)

Leetcode 18. 4Sum (Medium) (cpp)

Tag: Array, Hash Table, Two Pointers

Difficulty: Medium

/*

18. 4Sum (Medium)

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: 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>& nums, int target) {
        vector<vector<int>> res;
        int _size = nums.size();
        if (_size < 4) {
            return res;
        }
        sort(nums.begin(), nums.end());
        for (int i = 0; i < _size - 3; i++) {
            if (i > 0 && nums[i] == nums[i-1] || nums[i] + nums[_size - 3] + nums[_size - 2] + nums[_size - 1] < target) {
                continue;
            }
            if (nums[i] + nums[i + 1] + nums[i + 2] + nums[i + 3] > target) {
                break;
            }
            for (int j = i + 1; j < _size - 2; j++) {
                if (j > i + 1 && nums[j] == nums[j - 1] || nums[i] + nums[j] + nums[_size - 2] + nums[_size - 1] < target) {
                    continue;
                }
                if (nums[i] + nums[j] + nums[j + 1] + nums[j + 2] > target) {
                    break;
                }
                int k = j + 1, l = _size - 1;
                while (k < l) {
                    int _sum = nums[i] + nums[j] + nums[k] + nums[l];
                    if (_sum == target) {
                        res.push_back(vector<int>{nums[i], nums[j], nums[k], nums[l]});
                        k++;
                        l--;
                        while (nums[k] == nums[k - 1] && k < l) {
                            k++;
                        }
                        while (nums[l] == nums[l + 1] && k < l) {
                            l--;
                        }
                    }
                    else if (_sum > target) {
                        l--;
                    }
                    else {
                        k++;
                    }
                }
            }
        }
        return res;
    }
};