LeetCode之三数之和
双指针解法
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums) {
vector<vector<int>> ans;
if (nums.size() <= 2) return ans;
sort(nums.begin(), nums.end()); // 升序排列
int len = nums.size();
for (int i = 0; i < len; ++i) {
if (nums[i] > 0) {
break;
}
if ((i != 0) && (nums[i] == nums[i - 1])) {
continue;
}
int left = i + 1;
int right = len - 1;
while(left < right) {
// 最大的数应该为非负
if (nums[right] < 0) {
break;
}
int sum = nums[i] + nums[left] + nums[right];
if (sum > 0) {
--right;
} else if (sum < 0) {
++left;
} else {
ans.push_back({nums[i], nums[left], nums[right]});
// 左右指针各收缩一步
--right;
++left;
// 若各自收缩的一步无效,则继续收缩直至有效或至收缩的尽头
while((right > left) && (nums[right] == nums[right + 1])) --right;
while((right > left) && (nums[left] == nums[left - 1])) ++left;
}
}
}
return ans;
}
};
PS:
1.sort会损坏输入的nums,不过好像LeetCode不care;
2.用两层for会超时,用set筛选相同的也会超时;
3.上述双指针在找到一组解后,继续收缩时,left或right相同的应该过滤掉;
4.由于排序了,则可以使用两次break来取巧。
普通解法
两层for循环加一个find,超时严重,可以仔细琢磨算法的效率
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums) {
vector<vector<int>> ans;
if (nums.size() <= 2) return ans;
sort(nums.begin(), nums.end()); // 升序排列
int len = nums.size();
for (int i = 0; i < len; ++i) {
if (nums[i] > 0) {
break;
}
if ((i != 0) && (nums[i] == nums[i - 1])) {
continue;
}
for (int j = len - 1; j > i + 1; --j) {
if (nums[j] < 0) {
break;
}
if ((j != len - 1) && (nums[j] == nums[j + 1])) {
continue;
}
auto it = find(nums.begin() + i + 1, nums.begin() + j, -nums[i] - nums[j]);
if (it != nums.begin() + j) {
auto temp = {nums[i], *it, nums[j]};
ans.emplace_back(temp);
}
}
}
return ans;
}
};
LeetCode之四数之和
双指针解法
思路同上,注意防止溢出。
class Solution {
public:
vector<vector<int>> fourSum(vector<int>& nums, int target) {
int len = nums.size();
vector<vector<int>> ans;
if (len <= 3) return ans;
sort(nums.begin(), nums.end());
for (int i = 0; i < len - 1; ++i) {
if (nums[i] > target / 4) { // 左乘4会溢出
break;
}
if ((i > 0) && (nums[i] == nums[i - 1])) {
continue;
}
for (int j = len - 1; j >= i + 3; --j) {
if (nums[j] < target / 4) {
break;
}
if ((j < len - 1) && (nums[j] == nums[j + 1])) {
continue;
}
int left(i + 1);
int right(j - 1);
while (left < right) {
long sum = nums[i] + nums[left] + nums[right] + nums[j];
if (sum > static_cast<long>(target)) {
--right;
} else if (sum < static_cast<long>(target)) {
++left;
} else {
ans.push_back({nums[i], nums[left], nums[right], nums[j]});
--right;
++left;
while((left < right) && (nums[right] == nums[right + 1])) --right;
while((left < right) && (nums[left] == nums[left - 1])) ++left;
}
}
}
}
return ans;
}
};