3sum

1.问题描述

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)

2.问题分析

先排序，然后使用左右夹逼，时间复杂度O(n^2)。

3.代码

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;
	}
};

4.总结

本题的关键在于：
1、先排序；
2、将三个数之和转化为两个数之和，左右夹逼。