leetcode15+three sum

https://leetcode.com/problems/3sum/

class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
        vector<vector<int>>res;
        sort(nums.begin(), nums.end());
        for(int k=0;k<nums.size();k++){
            if(nums[k]>0) break;
            if(k>0&&nums[k]==nums[k-1]) continue; //防止重复
            int target=0-nums[k];
            int i=k+1, j=nums.size()-1;
            while (i<j) {//找到所有合适的
                if(nums[i]+nums[j]==target){
                    res.push_back({nums[k],nums[i],nums[j]});
                    while (i<j&&nums[i]==nums[i+1]) i+=1; //去重
                    while (i<j&&nums[j]==nums[j-1]) j-=1; //去重
                    i+=1; j-=1;
                }
                else if(nums[i]+nums[j]<target) i+=1;
                else j-=1;
            }
        }
        return res;
    }
};