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: 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> > ans;
        if (nums.size() < 3) return ans;
        
        sort(nums.begin(), nums.end());
        
        int i = 0;
        while (i < nums.size() - 3) 
        {
            int j = i + 1;
            while(j < nums.size() - 2)
            {
                int t = nums[i] + nums[j];
                int l = j + 1, r = nums.size() - 1;
                while (l < r)
                {
                    if (l < r && nums[l] + nums[r] < target - t) l++;
                    else if (l < r && nums[l] + nums[r] > target - t) r--;
                    else
                    {
                        vector<int> tmp;
                        tmp.push_back(nums[i]);
                        tmp.push_back(nums[j]);
                        tmp.push_back(nums[l]);
                        tmp.push_back(nums[r]);
                        ans.push_back(tmp);
                        int a = nums[l];
                        int b = nums[r];
                        
                        while(l < r && nums[l] == a){l++;}
                        while(l < r && nums[r] == b){r--;}
                    }
                }
                while (j < nums.size() - 2 && nums[j] == nums[++j]){};
            }
            
            while(i < nums.size() - 3 && nums[i] == nums[++i]){};
        }
        
        return ans;
    }
};