[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]
]

---

Personal tips:类似于2Sum和3sum问题，数组排序后，设立first,second,third,forth指针。当first与first+1,first+2,first+3指针之和大于target时，此时未遍历的数组中四个最小数之和大于target，跳出循环，大大缩小运行时间。代码如下：

class Solution {
public:
	vector<vector<int>> fourSum(vector<int>& nums, int target) {
		vector<vector<int>> combinations; int s = nums.size(); 
		sort(nums.begin(), nums.end());
		if (s < 4|| nums[s-1] + nums[s -2] + nums[s -3] + nums[s-4]<target) return combinations;	
		int first = 0;
		while (first<s-3)
		{
			if (nums[first] + nums[first + 1] + nums[first + 2] + nums[first + 3] > target) return combinations;
			int second = first + 1;
			while (second<s-2)
			{
				int third = second + 1;
				int forth = s - 1;
				while (third<forth)
				{		
					if (nums[first] + nums[second] + nums[third] + nums[forth] == target)
					{
						while (third < forth&&nums[third] == nums[third + 1]) { ++third; }
						while (third < forth&&nums[forth] == nums[forth - 1]) { --forth; }
						combinations.push_back({ nums[first] , nums[second] , nums[third++] , nums[forth--] });
						continue;
					}
					if (nums[first] + nums[second] + nums[third] + nums[forth] < target) { ++third; continue; }
					if (nums[first] + nums[second] + nums[third] + nums[forth] > target) { --forth; continue; }
				}
				while (second < nums.size() - 2 && nums[second] == nums[second + 1]) { ++second; }
				++second;
			}	
			while (first < s - 3 && nums[first] == nums[first + 1]) { ++first; }
			++first;
		}
		return combinations;
	}
};