LeetCode(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:

• 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)

问题分析：

这是典型的K-Sum问题，有三种解决办法1) 暴力求解Brute 时间复杂度O(N^3)    2) 对数组排序，然后采用夹逼法求解，时间复杂度O(N^2)，复杂度降一维。 3)采用hashtable法。本题主要讲解第而种方法，关于K-Sum的详细解法请参照Summary for LeetCode 2Sum, 3Sum, 4Sum, K Sum  ，要想明白3Sum，需要了解2Sum解法，如下所示，这是个经典问题，先排序，然后荣首尾指针分别向中间移动，两者和等于target

 1 //2 sum
 2 int i = starting; //头指针
 3 int j = num.size() - 1; //尾指针
 4 while(i < j) {
 5     int sum = num[i] + num[j];
 6         if(sum == target) {
 7             store num[i] and num[j] somewhere;
 8                 if(we need only one such pair of numbers)
 9                     break;
10                         otherwise
11                         do ++i, --j;
12         }
13         else if(sum < target)
14             ++i;
15         else
16             --j;
17 }

解题方法：

class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
        vector<vector<int> > ret;
        int len = nums.size();
        int tar = 0;
        
        if( len < 3){
            return ret;
        }
        
        sort( nums.begin(), nums.end() );
        
        for( int i = 0; i <= len -3; i++){
            int j = i + 1;
            int k = len -1;
            while( j < k ){
                if( nums[i] + nums[j] + nums[k] < tar){
                    j++;
                }
                else if( nums[i] + nums[j] + nums[k] > tar){ 
                    k--;
                }
                else{
                    ret.push_back({ nums[i], nums[j], nums[k] });
                    j++;
                    k--;
                    while( j < k && nums[j] == nums[j - 1])  j++;
                    while( j < k && nums[k] == nums[k + 1])  k--;
            }
        }
        while( i <= len -3 && nums[i] == nums[i + 1]) i++;
    }
    
    return ret;
  }
};