Leetcode|3 sum

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:

• Elements in a triplet (a,b,c) must be in non-descending order. (ie, a ≤ b ≤ c)
• 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)

解法1：采用左右夹逼法，考虑不周到，没有去重，也没注重效率，导致 Time Limit Exceeded

    vector<vector<int>> threeSum(vector<int>& nums) {
        vector<vector<int>> res;
        if(nums.size()<3) return res;
        sort(nums.begin(),nums.end());
        for(int i=0;i<nums.size();i++)
        {
            int a=nums[i];
            int low=i+1;
            int high=nums.size()-1;
            while(low<high)
            {
                if(nums[low]+nums[high]>-a)
                {
                    high--;
                }
                
                else if(nums[low]+nums[high]<-a)
                {
                    low++;
                }
                else{
                    vector<int> tmp(3);
                    tmp[0]=a;
                    tmp[1]=nums[low];
                    tmp[2]=nums[high];
                    res.push_back(tmp);
                    low++;
                }
            }
        }
        return res;
    }

优化后：加入两次去重，很OK

vector<vector<int>> threeSum(vector<int>& nums) {
        vector<vector<int>> res;
        if(nums.size()<3) return res;
        sort(nums.begin(),nums.end());
        for(int i=0;i<nums.size();i++)
        {
            if(i>0&&nums[i]==nums[i-1]) continue;//去重
            int a=nums[i];
            int low=i+1;
            int high=nums.size()-1;
            while(low<high)
            {
                if(nums[low]+nums[high]>-a)
                {
                   //do{
                       high--;
                   //}while(nums[high]==nums[high+1]); //去掉do while循环时间消耗减少
                }
                
                else if(nums[low]+nums[high]<-a)
                {
                    //do{
                       low++;
                   //}while(nums[low]==nums[low-1]); 
                }
                else{
                    vector<int> tmp(3);
                    tmp[0]=a;
                    tmp[1]=nums[low];
                    tmp[2]=nums[high];
                    res.push_back(tmp);
                    do{
                       low++;
                   }while(nums[low]==nums[low-1]); //去重
                }
            }
        }
        return res;
    }

在判断后两个数的和与-a的关系中，加入while循环不是很有必要，在leetcode下测试，基本时间没有区别。

而且加入do while 判断反而会对每次都多判断一次，如果前后不相等，时间消耗反而多了。leetcode下测试

不加do while 循环52ms 加入do while 循环为60ms左右。