Leetcode.15 三数之和
给你一个整数数组 nums ,判断是否存在三元组 [nums[i], nums[j], nums[k]] 满足 i != j、i != k 且 j != k ,同时还满足 nums[i] + nums[j] + nums[k] == 0 。请
你返回所有和为 0 且不重复的三元组。
注意:答案中不可以包含重复的三元组
例如, 给定数组 nums = [-1, 0, 1, 2, -1, -4],
满足要求的三元组集合为:
[
[-1, 0, 1],
[-1, -1, 2]
]
1. 核心代码
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums)
{
vector<vector<int>> result;
sort(nums.begin(), nums.end()); //将数组从小到大排序
for (int i = 0; i < nums.size(); i++)
{
if (nums[i] > 0)
return result;
if (i > 0 && nums[i] == nums[i - 1]) //是否与前一项相同
continue;
int left = i + 1;
int right = nums.size() - 1;
while (right > left) {
if (nums[i] + nums[left] + nums[right] > 0)
right--;
else if (nums[i] + nums[left] + nums[right] < 0)
left++;
else {
result.push_back(vector<int>{nums[i], nums[left], nums[right]});
while (right > left && nums[left] == nums[left + 1]) left++;
while (right > left && nums[right] == nums[right - 1]) right--;
left++;
right--;
}
}
}
return result;
}
};
2. 完整代码
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums)
{
vector<vector<int>> result;
sort(nums.begin(), nums.end()); //将数组从小到大排序
for (int i = 0; i < nums.size(); i++)
{
if (nums[i] > 0)
return result;
if (i > 0 && nums[i] == nums[i - 1]) //是否与前一项相同
continue;
int left = i + 1;
int right = nums.size() - 1;
while (right > left) {
if (nums[i] + nums[left] + nums[right] > 0)
right--;
else if (nums[i] + nums[left] + nums[right] < 0)
left++;
else {
result.push_back(vector<int>{nums[i], nums[left], nums[right]});
while (right > left && nums[left] == nums[left + 1]) left++;
while (right > left && nums[right] == nums[right - 1]) right--;
left++;
right--;
}
}
}
return result;
}
};
int main()
{
vector<int> nums;
int len, value;
cin >> len;
for (int i = 0; i < len; i++)
{
cin >> value;
nums.push_back(value);
}
Solution num;
for (int i = 0; i < num.threeSum(nums).size(); i++) {
for (int j = 0; j < 3; j++) {
cout << num.threeSum(nums)[i][j] << " ";
}
}
}
总结
使用双指针法。