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)

题意：找到数组中的三元组，三元组和为0，且不重复。

思路：与3sum closet 类似，先排序再采用夹逼法计算。注意跳过重复的数。

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