Leetcode 18 - 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:
Elements in a quadruplet (a,b,c,d) must be in non-descending order. (ie, a ≤ b ≤ c ≤ d)
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)

1 - 与3Sum类似，仍然是使用夹逼法。
2 - 具体做法：先对数组进行排序，然后固定i和j，将c和d向中间夹逼。
3 - 还应防止答案重复，因此每次移动下标时，都要使用一次while循环防止重复。

class Solution {
public:
    vector<vector<int>> fourSum(vector<int>& num, int target) {
          vector<vector<int>> result;
          if (num.size() < 4) return result;
          sort(num.begin(), num.end());
          int n = num.size();
          for (int i = 0; i < n-3; i++) 
          {
              if(i>0 && num[i]==num[i-1]) continue;       //avoid duplication
              for (int j = i+1; j < n-2; j++) 
              {
                  if(j>i+1 && num[j]==num[j-1]) continue; //avoid duplication
                  int c = j+1;
                  int d = n-1;
                   while (c < d) 
                {
                        if (num[i] + num[j] + num[c] + num[d] < target) 
                        {
                           c++;
                        } 
                        else if (num[i] + num[j] + num[c] + num[d] > target) 
                        {
                           d--;
                        } 
                        else 
                        {
                          result.push_back({num[i],num[j],num[c],num[d]});
                          while(c<d && num[c]==num[c+1]) c++; //avoid duplication
                          while(c<d && num[d]==num[d-1]) d--; //avoid duplication
                          c++;
                          d--;
                        }
                 }
              }
          }
       return result;
   }
};