注:此博客不再更新,所有最新文章将发表在个人独立博客limengting.site。分享技术,记录生活,欢迎大家关注
- 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]
]
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums) {
vector<vector<int>> result;
if (nums.size() < 3) return result;
sort(nums.begin(), nums.end());
const int target = 0;
auto last = nums.end();
for(auto i = nums.begin(); i < last - 2; ++ i) {
auto j = i + 1;
// 若i和前一个元素一样,则没有必要再检查一次
if (i > nums.begin()&& *i == *(i-1)) continue;
auto k = last - 1;
while (j < k) {
if (*i + *j + *k <target) {
++ j;
while(*j == *(j - 1) && j < k) ++ j;
} else if (*i + *j + *k >target) {
-- k;
while (*k == *(k + 1) && j < k) -- k;
} else {
result.push_back({*i, *j, *k});
++ j;
-- k;
while(*j == *(j - 1) && *k == *(k + 1) && j < k) ++ j;
}
}
}
return result;
}
};
- 3Sum Closest
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exactly one solution.
For example, given array S = {-1 2 1 -4}, and target = 1.
The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).
class Solution {
public:
int threeSumClosest(vector<int>& nums, int target) {
int result = 0;
int min_gap = INT_MAX;
sort(nums.begin(), nums.end());
for (auto a = nums.begin(); a != prev(nums.end(), 2); ++a) {
auto b = next(a);
auto c = prev(nums.end());
while (b < c) {
const int sum = *a + *b + *c;
const int gap = abs(sum - target);
if (gap < min_gap) {
result = sum;
min_gap = gap;
}
if (sum < target) ++b;
else if(sum == target) return result;
else --c;
}
}
return result;
}
};