15 三数之和

#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>

class Solution
{
public:
    vector<vector<int>>threeSum(vector<int> &nums)
    {
        vector<vector<int>>result;
        sort(nums.begin(), nums.end());   //从小到大排序

        for (int i = 0; i < nums.size(); i++)
        {
            if (nums[i] > 0)
            {
                return result;
            }

            if (i > 0 && nums[i] == nums[i - 1])
            {
                continue;   //在遍历的过程中如果该数字与前一个数字相同则跳过
            }

            int left = i + 1;
            int right = nums.size() - 1;
            while (right > left)
            {
                if (nums[i] + nums[left] + nums[right] > 0)
                    right--;

                else if (nums[i] + nums[left] + nums[right] < 0)
                    left++;

                else 
                {
                    result.push_back(vector<int>{nums[i], nums[left], nums[right]});
                    while (right > left && nums[right] == nums[right - 1])
                        right--;
                    while (right > left && nums[left] == nums[left + 1])
                        left++;   //这两个while是避开相同元素

                    right--;
                    left++;         //寻找下一位相同的元素
                }
            }
        }
        return result;
    }
};
//为什么right不能等于left,

int main()
{
    Solution aaa;
    vector<int>bbb{ -1,0,1,2,-1,-4 };
    aaa.threeSum(bbb);

    system("pause");
    return 0;
}