给定一个包含 n 个整数的数组 nums 和一个目标值 target,判断 nums 中是否存在四个元素 a,b,c 和 d ,使得 a + b + c + d 的值与 target 相等?找出所有满足条件且不重复的四元组。
注意:
答案中不可以包含重复的四元组。
示例:
给定数组 nums = [1, 0, -1, 0, -2, 2],和 target = 0。
满足要求的四元组集合为:
[
[-1, 0, 0, 1],
[-2, -1, 1, 2],
[-2, 0, 0, 2]
]
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/4sum
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
题解:
排序+双指针
class Solution {
public:
vector<vector<int>> fourSum(vector<int>& nums, int target) {
vector<vector<int>> res;
int n = nums.size();
if (n < 4)
return res;
sort(nums.begin(), nums.end());
int first, second, third, forth;
for (first = 0; first < n - 3; first ++) {
// 去除重复的a
if (first > 0 && nums[first] == nums[first - 1])
continue;
if (nums[first] + nums[first + 1] + nums[first + 2] + nums[first + 3] > target)
break;
if (nums[first] + nums[n - 3] + nums[n - 2] + nums[n - 1] < target)
continue;
for (second = first + 1; second < n - 2; second ++) {
// 去除重复的b
if (second > first + 1 && nums[second] == nums[second - 1])
continue;
if (nums[first] + nums[second] + nums[second + 1] + nums[second + 2] > target)
break;
if (nums[first] + nums[second] + nums[n - 2] + nums[n - 1] < target)
continue;
third = second + 1;
forth = n - 1;
while (third < forth) {
int temp = nums[first] + nums[second] + nums[third] + nums[forth];
if (temp < target) {
third ++;
} else if (temp > target){
forth --;
} else {
res.push_back({nums[first], nums[second], nums[third], nums[forth]});
// 去重
while (third < forth && nums[third] == nums[third + 1])
third ++;
// 去重
while (forth > third && nums[forth] == nums[forth - 1])
forth --;
third ++;
forth --;
}
}
}
}
return res;
}
};