[leetcode]15. 3Sum

[leetcode]15. 3Sum

---

Analysis

中秋节了，中午要去吃海底捞—— [嘻嘻~]

Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.
Note:
The solution set must not contain duplicate triplets.
先对数组进行排序，然后遍历数组，只要遍历到倒数第三位就行了。第一遍遍历确定一个数，然后用0减去这个数得到tmp，再用双指针遍历剩下的数，如果两个数相加等于tmp，则存入结果中，再继续遍历。注意要去重。

Implement

class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
        vector<vector<int>> res;
        int len = nums.size();
        sort(nums.begin(), nums.end());
        if(len == 0)
            return res;
        if(nums[len-1] < 0)
            return res;
        for(int i=0; i<len-2; i++){
            if(nums[i] > 0)
                break;
            if(i>0 && nums[i] == nums[i-1])
                continue;
            int target = 0-nums[i];
            int left = i+1;
            int right = len-1;
            while(left < right){
                if(nums[left]+nums[right] == target){
                    res.push_back({nums[i], nums[left], nums[right]});
                    while(left < right && nums[left] == nums[left+1])
                        left++;
                    while(left < right && nums[right] == nums[right-1])
                        right--;
                    left++;
                    right--;
                }
                else if(nums[left]+nums[right] < target)
                    left++;
                else
                    right--;
            }
        }
        return res;
    }
};