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

Update 0018.四数之和.md

Browse Source 
Java版本第二个for循环内的剪枝操作直接return会漏解，应该是break
This commit is contained in:
fang_chenfang
2024-08-06 10:36:18 +08:00
committed by GitHub
parent e599e6aee1
commit d38135b219
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]去重