4Sum

继续运用3sum的思路，3sum会做这道题就很简单：最内层循环同样是使用iterator首尾指向已排序的vector数列，外层则是双循环,将其转化为2sum的模式即target=target-nums[i]-nums[j]
要注意的是每次push_back temp前要先sort一下temp,为了之后的unique去重

vector<vector<int>> fourSum(vector<int>& nums, int target) {
	int k;
	vector<int>::iterator it1, it2;
	vector<int>temp;
	vector<vector<int>>ans;
	sort(nums.begin(), nums.end());
	for (int i = 1; i < nums.size(); ++i) {
		if (i < nums.size() - 1 && nums[i - 1] == nums[i])++i;
		for (int j = 0; j < i; ++j) {
			if (j > 0 && j < i - 1 && nums[j - 1] == nums[j])++j;
			k = target - nums[i] - nums[j];
			it1 = nums.begin();
			it2 = nums.end() - 1;
			while (it1 < it2) {
				while ((it1 - nums.begin() == i || it1 - nums.begin() == j)&&it1!=nums.end())++it1;
				while ((it2 - nums.begin() == i || it2 - nums.begin() == j)&&it2-nums.begin()>0)--it2;
				if (it1 >= it2)break;
					if (*it1 + *it2 == k) {
						temp.push_back(nums[i]);
						temp.push_back(nums[j]);
						temp.push_back(*it1);
						temp.push_back(*it2);
						sort(temp.begin(), temp.end());
						ans.push_back(temp);
						temp.clear();
						--it2;
					}
					else if (*it1 + *it2 < k) {
						++it1;
					}
					else {
						--it2;
					}
			}
		}
	}
	sort(ans.begin(), ans.end());
	ans.erase(unique(ans.begin(), ans.end()), ans.end());
	return ans;
}