Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 13cb15c

Browse files
添加0018.四数之和.md的Java版本的注释
1 parent 61c04cd commit 13cb15c

File tree

1 file changed

+3
-2
lines changed

1 file changed

+3
-2
lines changed

‎problems/0018.四数之和.md‎

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -253,7 +253,7 @@ public class Solution {
253253
for (int k = 0; k < nums.length; k++) {
254254
// 剪枝处理
255255
if (nums[k] > target && nums[k] >= 0) {
256-
break;
256+
break; // 此处的break可以等价于return result;
257257
}
258258
// 对nums[k]去重
259259
if (k > 0 && nums[k] == nums[k - 1]) {
@@ -262,7 +262,7 @@ public class Solution {
262262
for (int i = k + 1; i < nums.length; i++) {
263263
// 第二级剪枝
264264
if (nums[k] + nums[i] > target && nums[k] + nums[i] >= 0) {
265-
break;
265+
break; // 注意是break到上一级for循环,如果直接return result;会有遗漏
266266
}
267267
// 对nums[i]去重
268268
if (i > k + 1 && nums[i] == nums[i - 1]) {
@@ -802,3 +802,4 @@ end
802802
<a href="https://programmercarl.com/other/kstar.html" target="_blank">
803803
<img src="../pics/网站星球宣传海报.jpg" width="1000"/>
804804
</a>
805+

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /