leetcode:4Sum [18]

最新推荐文章于 2020-06-13 10:17:53 发布

原创最新推荐文章于 2020-06-13 10:17:53 发布 · 263 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

C++ 同时被 3 个专栏收录

26 篇文章

订阅专栏

leetcode

23 篇文章

订阅专栏

笔试题

16 篇文章

订阅专栏

本文介绍了一种解决四数之和问题的高效算法。该算法通过先对数组进行排序，然后利用双指针技巧遍历数组寻找所有唯一四元组，使其和等于目标值。在遍历过程中避免重复解，确保了输出结果的唯一性。

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

class Solution {
public:
	//int threeSumClosest(vector<int>& nums, int target) 
	vector<vector<int>> fourSum(vector<int>& nums, int target) {
		sort(nums.begin(), nums.end());
		vector<vector<int>> foursum;
		vector<int> sum;
		if (nums.empty()) return foursum;
		int mini = nums[0] + nums[1] + nums[2] + nums[3];
		for (int i = 0; i < nums.size()-3; i++) {
			if (i != 0 && nums[i] > target&& nums[i]>0) break;
			if (i != 0 && nums[i] == nums[i - 1]) continue;
			for (int j = i + 1; j < nums.size()-2; j++) {
				if (j > i + 1 && nums[j] == nums[j - 1]) continue;
				if (nums[i] + nums[j] > target&&nums[j]>0) break;
				int left = j + 1, right = nums.size() - 1;
				int sums = nums[i] + nums[j];
				while (left < right) {
					if (sums + nums[left] + nums[right] == target) {
						sum.push_back(nums[i]);
						sum.push_back(nums[j]);
						sum.push_back(nums[left]);
						sum.push_back(nums[right]);
						foursum.push_back(sum);
						sum.clear();
						while (nums[left + 1] == nums[left]) left++;
						left++;
					}
					else if (sums + nums[left] + nums[right] < target) {
						left++;
					}
					else {
						right--;
					}
				}
				
			}
		}
		return foursum;
	}
};