算法设计与分析(9)
题目:3Sum
问题描述:Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.
Note: The solution set must not contain duplicate triplets.
For example, given array S = [-1, 0, 1, 2, -1, -4]
A solution set is:
[[-1, 0, 1], [-1, -1, 2]]
算法思路:
这里给出一个O(n^2)的算法。
1.这道题的思路是基于“2Sum”(给一个数n, 在一个数组中找出两个数,使他们的和等于n)。如果了解的“2Sum”思路,那么这里3Sum的思路就很容易想出来的:给定数组vector<int> nums
中的一个数a,那么我们从数组中找出另外两个数b和c,使得b+c=-a。
sort(nums.begin(), nums.end());
2.使用vector<vector<int>> result;
记录结果。
3.我们首先选定n,这里n可以从数组nums[0]
遍历至nums[nums.size() - 3]
,然后使用求2Sum的算法,取n = -nums[i]
为目标值,求first
,second
,使得nums[first]+nums[second] = n
.
int len = nums.size();
for (int i = 0; i < len - 2;++i)
(1)first
,second
分别初始化为i + 1和len-1;
int first = i + 1, second = len - 1;
(2)这里使用求2Sum的算法,但是要注意:输出结果的唯一性。如果我们找到first
和second
,满足nums[first]+nums[second] = n
,那么我们需要找下一个first'
和 second'
时,应该满足nums[first']!=nums[first]
, nums[second']!=nums[second]
;
while (first < second)
{
while (nums[first] + nums[second] > n && first < second) --second;
while (nums[first] + nums[second] < n && first < second) ++first;
if (nums[first] + nums[second] == n && first < second)
{
vector<int> temp(3);
temp[0] = nums[i];
temp[1] = nums[first];
temp[2] = nums[second];
result.push_back(temp);
while (nums[first] == temp[1] && first < second) ++first;
while (nums[second] == temp[2] && first < second) --second;
}
}
(3)除了考虑first'
和 second'
满足nums[first']!=nums[first]
, nums[second']!=nums[second]
,最后当然也要考虑n出现重复的情况,避免结果重复:
while (i + 1 < len - 2 && nums[i] == nums[i + 1])
++i;
实现代码:
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
vector<vector<int>> threeSum(vector<int>& nums)
{
int len = nums.size();
sort(nums.begin(), nums.end());
vector<vector<int>> result;
for (int i = 0; i < len - 2;++i)
{
int n = -nums[i];
//find 2Sum for nums[i]
int first = i + 1, second = len - 1;
while (first < second)
{
while (nums[first] + nums[second] > n && first < second) --second;
while (nums[first] + nums[second] < n && first < second) ++first;
if (nums[first] + nums[second] == n && first < second)
{
vector<int> temp(3);
temp[0] = nums[i];
temp[1] = nums[first];
temp[2] = nums[second];
result.push_back(temp);
while (nums[first] == temp[1] && first < second) ++first;
while (nums[second] == temp[2] && first < second) --second;
}
}
while (i + 1 < len - 2 && nums[i] == nums[i + 1])
++i;
}
return result;
}
int main()
{
int a[] = { 1,2,-2,-1 };
vector<int> nums(a, a + 4);
vector<vector<int>> res;
res = threeSum(nums);
for (int i = 0; i < res.size();++i)
{
for (int j = 0; j < 3; ++j)
{
cout << res[i][j] << " ";
}
cout << endl;
}
return 0;
}