LeetCode:3Sum

描述

Given an array S of n integers, are there elements a,b,c in S such that a+b+c = 0? Find all uniquetriplets 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)

给出一个Int型的数组S，在数组中找到所有的满足以下条件的的元组：

（1）元组包含3个元素a、b、c

（2）a+b+c=0

  (3)  a ≤ b ≤ c

解题思路：

先排序,然后左右夹逼,复杂度 O(n2)。

这个方法可以推广到 k-sum,先排序,然后做 k − 2 次循环,在最内层循环左右夹逼,时间复杂度是 O(max{n log n, nk−1 })。 

代码：

// LeetCode, 3Sum
// 先排序,然后左右夹逼,时间复杂度 O(n^2),空间复杂度 O(1) 
class Solution {
public:
      vector<vector<int>> threeSum(vector<int>& num) {
          vector<vector<int>> result;
          if (num.size() < 3) return result;
          sort(num.begin(), num.end());
          const int target = 0;
          auto last = num.end();
          for (auto a = num.begin(); a < prev(last, 2); ++a) {
              auto b = next(a);
              auto c = prev(last);
              while (b < c) {
                  if (*a + *b + *c < target) {
                      ++b;
                  } else if (*a + *b + *c > target) {
                      --c;
                  } else {
                      result.push_back({ *a, *b, *c });
                      ++b;
                      --c;
                  } 
              }
          }
          sort(result.begin(), result.end());
          result.erase(unique(result.begin(), result.end()), result.end());
          return result;
      } 
};