Merge pull request #2670 from 20281308/master

0018.四数之和 Java版本剪枝漏解
2025-07-06 15:09:40 +08:00 · 2024-08-18 09:32:53 +08:00
parent 2eddf2ff31 d38135b219
commit f16c640b28
1 changed files with 1 additions and 1 deletions
--- a/problems/0018.四数之和.md
+++ b/problems/0018.四数之和.md
@ -264,7 +264,7 @@ class Solution {

 		// 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]去重