Update 0018.四数之和.md

add 剪枝 to the second for loop
This commit is contained in:
SteveL
2024-06-27 07:33:01 -04:00
committed by GitHub
parent 240684f35e
commit 718d3c065a

View File

@ -262,6 +262,11 @@ class Solution {
for (int j = i + 1; j < nums.length; j++) {
// nums[i]+nums[j] > target 直接返回, 剪枝操作
if (nums[i]+nums[j] > 0 && nums[i]+nums[j] > target) {
return result;
}
if (j > i + 1 && nums[j - 1] == nums[j]) { // 对nums[j]去重
continue;
}