Leetcode-15-三數(shù)之和

給你一個(gè)包含 n 個(gè)整數(shù)的數(shù)組 nums，判斷 nums 中是否存在三個(gè)元素 a，b，c ，使得 a + b + c = 0 ？請(qǐng)你找出所有滿足條件且不重復(fù)的三元組。

class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums)
    {
        vector<vector<int>> ans;
        sort(nums.begin(),nums.end());
        int len = nums.size();
        for(int first = 0; first < len; ++first)
        {
            if(first > 0 && nums[first] == nums[first-1])
            {
                continue;
            }
            int third = len-1;
            int target = -nums[first];
            for(int second = first + 1; second < len; ++second)
            {
                if(second > first+1 && nums[second] == nums[second -1])
                {
                    continue;
                }
                while(second < third && nums[second] + nums[third] > target)
                {
                    --third;
                }
                if(second == third) 
                {
                    break;
                }
                if(nums[second] + nums[third] == target)
                {
                    ans.push_back({nums[first], nums[second], nums[third]});
                }
            }

        }
        return ans;
    }
};