4Sum

Given an array S of n integers, are there elements a; b; c, and d in S such that a + b + c + d = target?
Find all unique quadruplets in the array which gives the sum of target.
Note:
• Elements in a quadruplet (a; b; c; d) must be in non-descending order. (ie, a ≤ b ≤ c ≤ d)
• The solution set must not contain duplicate quadruplets.
For example, given array S = {1 0 -1 0 -2 2}, and target = 0.
A solution set is:
(-1, 0, 0, 1)
(-2, -1, 1, 2)
(-2, 0, 0, 2)
方法一：左右夹逼，先排序，然后左右夹逼，时间复杂度 O(n^3)，空间复杂度 O(1)

class Solution
{
public:
	vector<vector<int>> fSum(vector<int>& num, int target)
	{
		vector<vector<int>> result;
//当数据小于4时返回
		if (num.size() < 4)
			return result;
//排序
		sort(num.begin(), num.end());
		auto last = num.end();
//内部双循环
		for (auto a = num.begin();a != prev(num.end(), 3);++a)
		{
			for (auto b = next(a);b != prev(num.end(), 2);++b)
			{
				auto c = next(b);
				auto d = num.end();
				while (c < d)
				{
					if (*a + *b + *c + *d < target)
					{
						++c;
					}
					else if (*a + *b + *c + *d > target)
					{
						--d;
					}
//相等时，存入result中
					else
					{
						result.push_back({ *a,*b,*c,*d });
						++c;
						--d;
					}
				}
			}
		}
//再排序，把重复的数据删除
		sort(result.begin(), result.end());
		result.erase(unique(result.begin(), result.end()), result.end());
		return result;
	}
};