[15]3Sum

【题目描述】

Given an array S of n integers, are there elements a, b, c in S 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.

For example, given array S = [-1, 0, 1, 2, -1, -4],

A solution set is:
[
  [-1, 0, 1],
  [-1, -1, 2]
]

【解题思路】

时间复杂度O（n2），空间复杂度：O（1）

【代码】

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