https://www.nowcoder.com/practice/345e2ed5f81d4017bbb8cc6055b0b711
思路:先将数组升序排序,再遍历数组,使用头尾指针寻找两个和为当前数相反数的数,注意不要出现重复
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector<vector<int>> threeSum(vector<int> &numbers) {
vector<vector<int>> ans;
int len = numbers.size();
if (len >= 3) { // 边界判断
sort(numbers.begin(), numbers.end()); // 升序排序,方便后续使用头尾指针
for (int i = 0; i <= len - 3; ++i) {
if (i > 0 && numbers[i] == numbers[i - 1]) // 当前元素与前一元素相同,跳过
continue;
int target = -numbers[i]; // 从[i+1,len-1]区间内找剩余的两个数,其和为numbers[i]相反数
for (int j = i + 1, k = len - 1; j < k;) {
if (numbers[j] + numbers[k] == target) { // 满足条件,即numbers[i]+numbers[j]+numbers[k]==0
vector<int> temp{numbers[i], numbers[j], numbers[k]};
if (ans.empty() || temp != ans.back()) // 判断是否存在重复结果
ans.push_back(temp);
j++; k--; // 头尾指针向中间移动
} else if (numbers[j] + numbers[k] < target) {
j++; // 两数之和小于target,头指针后移
} else {
k--; // 两数之和大于target,尾指针前移
}
}
}
}
return ans;
}
int main() {
// vector<int> v{-2, 0, 1, 1, 2};
// vector<int> v{-10, 0, 10, 20, -10, -40};
vector<int> v{-4, -2, 1, -5, -4, -4, 4, -2, 0, 4, 0, -2, 3, 1, -5, 0};
auto ans = threeSum(v);
for (auto it1: ans) {
for (auto it2: it1) {
cout << it2 << " ";
}
cout << endl;
}
return 0;
}