18. 四数之和
难度中等949收藏分享切换为英文接收动态反馈
给你一个由 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]]
提示:
1 <= nums.length <= 200
-109 <= nums[i] <= 109
-109 <= target <= 109
1. 思路
依旧是双指针+去重的思路。
2. c++
#include <iostream>
#include <vector>
#include <algorithm>
#include <sstream>
using namespace std;
class Solution {
public:
vector<vector<int>> fourSum(vector<int>& nums, int target)
{
vector<vector<int>> ret = {};
sort(nums.begin(),nums.end());
int n = nums.size();
for (int i = 0; i<n-3;++i)
{
if (i > 0 && nums[i] == nums[i-1])
{
continue;
}
for (int j = i+1;j < n-2;++j)
{
if (j > i+1 && nums[j] == nums[j-1])
{
continue;
}
int left = j+1,right = n-1;
while (left < right)
{
long sum = (long)nums[i] + nums[j] + nums[left] + nums[right];
if (sum == target)
{
vector<int> tmp = {nums[i], nums[j], nums[left], nums[right]};
ret.push_back(tmp);
while (left < right && nums[left] == nums[left+1])
{
++left;
}
while (left < right && nums[right] == nums[right-1])
{
--right;
}
++left;
--right;
}
else if (sum < target)
{
++left;
}
else
{
--right;
}
}
}
}
return ret;
}
};
void print_vec_vec(vector<vector<int>>& vec_vec_nums)
{
for (auto& vec:vec_vec_nums)
{
for (auto num:vec)
{
cout<<num<<" ";
}
cout<<endl;
}
}
int main()
{
Solution s_obj;
vector<int> nums;
int target = 0;
int input = 0;
string inputline;
cout<<"input your sequence: ";
getline(cin,inputline);
istringstream stream(inputline);
while (stream >> input)
{
nums.push_back(input);
}
cout<<endl<<"input your target: ";
cin>>target;
vector<vector<int>> ret = s_obj.fourSum(nums,target);
cout<<endl<<"\nthis is you result:\n";
print_vec_vec(ret);
}