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

添加0018.四数之和.md的Java版本的注释

Browse Source
This commit is contained in:
‘windscape’
2025-01-13 16:33:28 +08:00
parent 61c04cdc43
commit 13cb15cad6
1 changed files with 3 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -253,7 +253,7 @@ public class Solution {
for (int k = 0; k < nums.length; k++) { for (int k = 0; k < nums.length; k++) {
// 剪枝处理 // 剪枝处理
if (nums[k] > target && nums[k] >= 0) { if (nums[k] > target && nums[k] >= 0) {
break; break; // 此处的break可以等价于return result;
} }
// 对nums[k]去重 // 对nums[k]去重
if (k > 0 && nums[k] == nums[k - 1]) { if (k > 0 && nums[k] == nums[k - 1]) {
@ -262,7 +262,7 @@ public class Solution {
for (int i = k + 1; i < nums.length; i++) { for (int i = k + 1; i < nums.length; i++) {
// 第二级剪枝 // 第二级剪枝
if (nums[k] + nums[i] > target && nums[k] + nums[i] >= 0) { if (nums[k] + nums[i] > target && nums[k] + nums[i] >= 0) {
break; break; // 注意是break到上一级for循环，如果直接return result;会有遗漏
} }
// 对nums[i]去重 // 对nums[i]去重
if (i > k + 1 && nums[i] == nums[i - 1]) { if (i > k + 1 && nums[i] == nums[i - 1]) {
@ -802,3 +802,4 @@ end
<a href="https://programmercarl.com/other/kstar.html" target="_blank"> <a href="https://programmercarl.com/other/kstar.html" target="_blank">
<img src="../pics/网站星球宣传海报.jpg" width="1000"/> <img src="../pics/网站星球宣传海报.jpg" width="1000"/>
</a> </a>