algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 08:50:15 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #1090 from weiting-cn/master

Browse Source 
更新：0015.三数之和，0018.四数之和：去重优化
This commit is contained in:
程序员Carl
2022-03-06 11:30:53 +08:00
committed by GitHub
parent a1d383513a 5c34fe5381
commit 7532e6ea7a
2 changed files with 8 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
problems/0015.三数之和.md
View File

@ -138,8 +138,12 @@ public:
*/ */
if (nums[i] + nums[left] + nums[right] > 0) { if (nums[i] + nums[left] + nums[right] > 0) {
right--; right--;
// 当前元素不合适了，可以去重
while (left < right && nums[right] == nums[right + 1]) right--;
} else if (nums[i] + nums[left] + nums[right] < 0) { } else if (nums[i] + nums[left] + nums[right] < 0) {
left++; left++;
// 不合适，去重
while (left < right && nums[left] == nums[left - 1]) left++;
} else { } else {
result.push_back(vector<int>{nums[i], nums[left], nums[right]}); result.push_back(vector<int>{nums[i], nums[left], nums[right]});
// 去重逻辑应该放在找到一个三元组之后 // 去重逻辑应该放在找到一个三元组之后

4
problems/0018.四数之和.md
View File

@ -91,9 +91,13 @@ public:
// nums[k] + nums[i] + nums[left] + nums[right] > target 会溢出 // nums[k] + nums[i] + nums[left] + nums[right] > target 会溢出
if (nums[k] + nums[i] > target - (nums[left] + nums[right])) { if (nums[k] + nums[i] > target - (nums[left] + nums[right])) {
right--; right--;
// 当前元素不合适了，可以去重
while (left < right && nums[right] == nums[right + 1]) right--;
// nums[k] + nums[i] + nums[left] + nums[right] < target 会溢出 // nums[k] + nums[i] + nums[left] + nums[right] < target 会溢出
} else if (nums[k] + nums[i] < target - (nums[left] + nums[right])) { } else if (nums[k] + nums[i] < target - (nums[left] + nums[right])) {
left++; left++;
// 不合适，去重
while (left < right && nums[left] == nums[left - 1]) left++;
} else { } else {
result.push_back(vector<int>{nums[k], nums[i], nums[left], nums[right]}); result.push_back(vector<int>{nums[k], nums[i], nums[left], nums[right]});
// 去重逻辑应该放在找到一个四元组之后 // 去重逻辑应该放在找到一个四元组之后