目录
题目描述:
Given an array nums
of n integers, are there elements a, b, c in nums
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.
Example:
Given array nums = [-1, 0, 1, 2, -1, -4],
A solution set is:
[
[-1, 0, 1],
[-1, -1, 2]
]
算法描述:
1、暴力枚举,算法复杂度O(n^3);
2、枚举第一个数和第二个数
排除所有重复情况,但是测试时间还是达到了844ms
//非常关键的问题是解决几组答案重复的问题
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums) {
unordered_map<int,vector<int>> m;
vector<vector<int>> res;
for(int i = 0; i < nums.size(); i++)
{
m[nums[i]].push_back(i);
}
for(int i = 0; i < nums.size(); i++)
{
if(m[nums[i]].front() < i) continue;
for(int j = i + 1; j < nums.size(); j ++)
{
if(m[nums[j]].front() == i && m[nums[j]][1] < j) continue;
if(m[nums[j]].front() != i && m[nums[j]].front() < j)continue;
int suanz = -(nums[i] + nums[j]);
if(m.count(suanz) && (m[suanz].front() > j || (m[suanz].size() > 1 && m[suanz][1] > j && (m[suanz].front() == i || m[suanz].front() == j)) || (m[suanz].size() > 2 && m[suanz].front() == i && m[suanz][1] == j && m[suanz][2] > j)))
{
vector<int> oneres;
oneres.push_back(nums[i]);
oneres.push_back(nums[j]);
oneres.push_back(nums[m[suanz].back()]);
res.push_back(oneres);
}
}
}
return res;
}
};
3、将数组排序后,将3Sum问题转换为2Sum问题
首先将数组排序,取出一个数x后,变成在剩余数中找和为-x的2sum问题;另外,由于进行了排序,所以排除重复结果也就变的简单了。
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums) {
int twoSum;
vector<int> oneres(3);
vector<vector<int>> res;
if(nums.size() < 3) return res;
sort(nums.begin(),nums.end());
for(int i = 0; i < nums.size() - 2; )
{
oneres[0] = nums[i];
twoSum = - nums[i];
for(int j = i + 1, k = nums.size() - 1; j < k; ){
if(nums[j] + nums[k] == twoSum)
{
oneres[1] = nums[j];
oneres[2] = nums[k];
res.push_back(oneres);
while(j < k && nums[j + 1] == nums[j])j++;
while(j < k && nums[k - 1] == nums[k])k--;
j ++, k --;
}
else if(nums[j] + nums[k] < twoSum)j ++;
else k --;
}
while(i < nums.size() - 2 && nums[i + 1] == nums[i])i ++;
i ++;
}
return res;
}
};