专题复习：三数之和

(1) leetcode15. 三数之和

思路：先将nums进行排序 然后，在利用双指针

class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
        if(nums.size()==0) return {};
        vector<vector<int>> res;
        //对数组进行排序
        sort(nums.begin(), nums.end());
        for(int i = 0; i < nums.size(); i++)
        {
            if(nums[i] > 0) return res;
            if(i > 0 && nums[i] == nums[i-1]) continue;
            int left = i + 1;
            int right = nums.size() - 1;
            while(left < right)
            {
                if(nums[i] + nums[left] + nums[right] == 0)
                {
                    res.push_back({nums[i], nums[left], nums[right]});
                    while(left < right && nums[left] == nums[left+1])
                    {
                        left++;
                    }
                    left++;
                    while(left < right && nums[right] == nums[right - 1])
                    {
                        right--;
                    }
                    right--;
                }
                else if(nums[i] + nums[left] + nums[right] < 0)
                {
                    left++;
                }
                else
                {
                    right--;
                }
            }
        }
        return res;
    }
};

（2）leetcode16. 最接近的三数之和

class Solution {
public:
    int threeSumClosest(vector<int>& nums, int target) {
    //排序后利用双指针
    sort(nums.begin(),nums.end());//对数组进行排序
    int distance = nums[0]+nums[1]+nums[2]-target;//对distance进行初始化
    for(int i = 0; i < nums.size()-2; i++)
    {
        int L = i + 1;
        int R = nums.size() -1;
        while(L<R)
        { 
            int distemp=(nums[L]+nums[R]+nums[i])- target;
            if(abs(distance)>abs(distemp)) distance = distemp;
            //distance = abs(distance)>abs(distemp)?distemp:distance;  
            if(nums[i]+nums[L]+nums[R] == target) 
            {
                distance = 0;
                break;
            }                    
            else if(nums[i]+nums[L]+nums[R]<target) L++; 
            else  R--;
        }      
    }
    return distance+target;
    }
};

（3） leetcode18. 四数之和

class Solution {
public:
    vector<vector<int>> fourSum(vector<int>& nums, int target) {
        vector<vector<int>> finalNums;
        int size = nums.size();
        if(size<=3) return finalNums;
        else
        {
            sort(nums.begin(),nums.end());
            for(int i = 0; i < size-3; i++)//第一个元素
            {
                if( i > 0 && nums[i]==nums[i-1]) continue;
                for(int j = i+1; j < size-2; j++)
                {
                    if(j>i+1 && nums[j]==nums[j-1]) continue;//第二个元素 同样避免重复 
                    int L = j + 1;
                    int R = size - 1;
                    while(L < R)
                    {
                        int sum=nums[i]+nums[j]+nums[L]+nums[R];
                        if(sum<target)
                            while(L<R&&nums[L]==nums[++L]);
                        else if(sum>target)
                            while(L<R&&nums[R]==nums[--R]);
                        else{
                            finalNums.push_back(vector<int>{nums[i],nums[j],nums[L],nums[R]});
                            while(L<R&&nums[L]==nums[L+1]) L++;//避免重复
                            while(L<R&&nums[R]==nums[R-1]) R--;
                            L++;
                            R--;
                        }
                    }
                }
            }
            return finalNums;
        }

    }
};