题目描述
给你一个由 n
个整数组成的数组 nums
,和一个目标值 target
。请你找出并返回满足下述全部条件且不重复的四元组 [nums[a], nums[b], nums[c], nums[d]]
(若两个四元组元素一一对应,则认为两个四元组重复):
0 <= a, b, c, d < n
a
、b
、c
和d
互不相同nums[a] + nums[b] + nums[c] + nums[d] == target
你可以按 任意顺序 返回答案 。
示例 1:
输入:nums = [1,0,-1,0,-2,2], target = 0 输出:[[-2,-1,1,2],[-2,0,0,2],[-1,0,0,1]]
思路
代码
//给你一个由 n 个整数组成的数组 nums ,和一个目标值 target 。请你找出并返回满足下述全部条件且不重复的四元组 [nums[a], nums[b], nums[c], nums[d]] (若两个四元组元素一一对应,则认为两个四元组重复):
//
//0 <= a, b, c, d < n
// a、b、c 和 d 互不相同
// nums[a] + nums[b] + nums[c] + nums[d] == target
// 你可以按 任意顺序 返回答案 。
//
// 示例 1:
// 输入:nums = [1, 0, -1, 0, -2, 2], target = 0
// 输出: [[-2, -1, 1, 2], [-2, 0, 0, 2], [-1, 0, 0, 1]]
//
//
// 示例 2:
// 输入:nums = [2, 2, 2, 2, 2], target = 8
// 输出: [[2, 2, 2, 2]]
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
using namespace std;
class Solution {
public:
vector<vector<int>> fourSum(vector<int>& nums, int target) {
vector<vector<int>> quadruplets;
if (nums.size() < 4) {
return quadruplets;
}
sort(nums.begin(), nums.end());
int length = nums.size();
for (int i = 0; i < length - 3; i++) {
if (i > 0 && nums[i] == nums[i - 1]) {
continue;
}
if ((long)nums[i] + nums[i + 1] + nums[i + 2] + nums[i + 3] > target) {
break;
}
if ((long)nums[i] + nums[length - 3] + nums[length - 2] + nums[length - 1] < target) {
continue;
}
for (int j = i + 1; j < length - 2; j++) {
if (j > i + 1 && nums[j] == nums[j - 1]) {
continue;
}
if ((long)nums[i] + nums[j] + nums[j + 1] + nums[j + 2] > target) {
break;
}
if ((long)nums[i] + nums[j] + nums[length - 2] + nums[length - 1] < target) {
continue;
}
int left = j + 1, right = length - 1;
while (left < right) {
long sum = (long)nums[i] + nums[j] + nums[left] + nums[right];
if (sum == target) {
quadruplets.push_back({ nums[i], nums[j], nums[left], nums[right] });
while (left < right && nums[left] == nums[left + 1]) {
left++;
}
left++;
while (left < right && nums[right] == nums[right - 1]) {
right--;
}
right--;
}
else if (sum < target) {
left++;
}
else {
right--;
}
}
}
}
return quadruplets;
}
};
class Solution1 {//优雅版
public:
vector<vector<int>> fourSum(vector<int>& nums, int target) {
vector<vector<int>> ans;
int len = nums.size();
sort(nums.begin(), nums.end());
if (len < 4) {
return ans;
}
for (int i = 0; i < len - 3; i++) {//固定第一个数
if (i > 0 && nums[i] == nums[i + 1])
continue;
if ((long)nums[i] + nums[i + 1] + nums[i + 2] + nums[i + 3] > target)
break;
if ((long)nums[i] + nums[len - 1] + nums[len - 2] + nums[len - 3] < target)
continue;
for (int j = i + 1; j < len - 2; j++) {//固定第二个数
if (j > i + 1 && nums[j] == nums[j + 1])
continue;
if ((long)nums[i] + nums[j] + nums[j + 2] + nums[j + 3] > target)
break;
if ((long)nums[i] + nums[j] + nums[len - 2] + nums[len - 1] < target)
continue;
int left = j + 1, right = len - 1;
while (left < right) {
long sum = (long)nums[i] + nums[j] + nums[left] + nums[right];
if (sum < target) {
left++;
}
else if (sum > target) {
right--;
}
else {
ans.push_back({ nums[i],nums[j],nums[left],nums[right] });
while (left < right && nums[left] == nums[++left]);
while (left < right && nums[right] == nums[--right]);
}
}
}
}
return ans;
}
};
int main() {
string input;
getline(cin, input);//[1,0,-1,0,-2,2]
input = input.substr(1, input.length() - 2);
istringstream iss(input);
vector<int> nums;
string numStr;
while (getline(iss, numStr, ',')) {
nums.push_back(stoi(numStr));
}
int target;
cin >> target;
Solution a;
vector<vector<int>> result;
string output = "";
string output_end = "";
result = a.fourSum(nums,target);
for (int i = 0; i < result.size(); i++) {
for (auto x : result[i]) {
output += to_string(x) + ',';
}
output_end += "[" + output.substr(0, output.size() - 1) + "]" + ',';
output.clear();//下一组的vector元素加进来之前,要把上次的output清空,不然该组的vector元素会包含上一组的所有元素;
}
cout << "[" << output_end.substr(0, output_end.size() - 1) << "]";//[[-1,-1,2],[-1,0,1]]
}