[LeetCode]18.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: 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]

]

解题思路：本题和15题类似，按照15题的思路解答

class MySolution {
public:
	vector<vector<int> > fourSum(vector<int> &num, int target)
	{
		vector<vector<int> > res;
		if (num.empty())
			return res;
		sort(num.begin(), num.end());
		for (int k = 0; k < num.size(); k++)
		{
			int target1 = target - num[k];

			for (int i = k + 1; i < num.size(); i++)
			{
				int target2 = target1 - num[i];
				int front = i + 1;
				int back = num.size() - 1;

				while (front < back)
				{
					int Tsum = num[front] + num[back];
					if (Tsum < target2)
						front++;
					else if (Tsum > target2)
						back--;
					else
					{
						vector<int> temp(4, 0);
						temp[0] = num[k];
						temp[1] = num[i];
						temp[2] = num[front];
						temp[3] = num[back];
						res.push_back(temp);
						//处理与第三个数相同的数      ++操作
						while (front < back && num[front] == temp[2]) front++;
						//处理与第四个数相同的数      --操作
						while (front < back && num[back] == temp[3]) back--;
					}
				}
				//处理与第2个数相同的数      ++操作
				while (i + 1 < num.size() && num[i + 1] == num[i])
					i++;
			}
			//处理与第1个数相同的数      ++操作
			while (k + 1 < num.size() && num[k + 1] == num[k])
				k++;
		}
		return res;
	}
};