LeetCode OJ--4Sum *

https://oj.leetcode.com/problems/4sum/

在一个数列中，找出所有的4个数，它们的和是target.

class Solution {
public:
    vector<vector<int> > fourSum(vector<int> &num, int target)  {
        vector<vector<int> > ans;
        if(num.size()<)
            return ans;

        sort(num.begin(),num.end());
        for(int i = ;i<num.size()-;i++)
        {
            if(i> && num[i]==num[i-])
                continue;

            calcThree(num,target - num[i],i,ans);
        }
        return ans;
    }
    void calcThree(vector<int> &num,int threeSum,int firstPosition,vector<vector<int> > &ans)
    {
        int k = ;

        for(int i = firstPosition+;i<num.size()-;i++)
        {
            if(i>firstPosition+ && num[i] == num[i-])
                continue;
            int j = i+;

            k = num.size()-;

            while(j<k)
            {
                if(num[i]+num[j]+num[k] == threeSum)
                {
                    if(ans.size()== || ans.size()> && !(num[firstPosition] == ans[ans.size()-][] && num[i]==ans[ans.size()-][]&& num[j] ==ans[ans.size()-][] ))
                    {
                        vector<int> ansPiece;
                        ansPiece.push_back(num[firstPosition]);
                        ansPiece.push_back(num[i]);
                        ansPiece.push_back(num[j]);
                        ansPiece.push_back(num[k]);
                        ans.push_back(ansPiece);
                    }
                    j++;
                }
                else if(num[i]+num[j]+num[k] < threeSum)
                    j++;
                else
                    k--;
            }
        }
    }
};