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 #2670 from 20281308/master

Browse Source 
0018.四数之和 Java版本剪枝漏解
This commit is contained in:
程序员Carl
2024-08-18 09:32:53 +08:00
committed by GitHub
parent 2eddf2ff31 d38135b219
commit f16c640b28
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -264,7 +264,7 @@ class Solution {
// nums[i]+nums[j] > target 直接返回, 剪枝操作 // nums[i]+nums[j] > target 直接返回, 剪枝操作
if (nums[i]+nums[j] > 0 && nums[i]+nums[j] > target) { if (nums[i]+nums[j] > 0 && nums[i]+nums[j] > target) {
return result; break;
} }
if (j > i + 1 && nums[j - 1] == nums[j]) { // 对nums[j]去重 if (j > i + 1 && nums[j - 1] == nums[j]) { // 对nums[j]去重