Jan 21, 2025 · Jan 13, 2025 · Jan 13, 2025 · Jan 15, 2025 · Jan 15, 2025 · Jan 17, 2025
diff --git a/problems/0018.四数之和.md b/problems/0018.四数之和.md
Original file line number	Diff line number	Diff line change
Expand Up		@@ -253,7 +253,7 @@ public class Solution {
		for (int k = 0; k < nums.length; k++) {
		// 剪枝处理
		if (nums[k] > target && nums[k] >= 0) {
	break;
	break; // 此处的break可以等价于return result;
		}
		// 对nums[k]去重
		if (k > 0 && nums[k] == nums[k - 1]) {
Expand All		@@ -262,7 +262,7 @@ public class Solution {
		for (int i = k + 1; i < nums.length; i++) {
		// 第二级剪枝
		if (nums[k] + nums[i] > target && nums[k] + nums[i] >= 0) {
	break;
	break; // 注意是break到上一级for循环,如果直接return result;会有遗漏
		}
		// 对nums[i]去重
		if (i > k + 1 && nums[i] == nums[i - 1]) {
Expand Down Expand Up		@@ -802,3 +802,4 @@ end
		<a href="https://programmercarl.com/other/kstar.html" target="_blank">
		<img src="../pics/网站星球宣传海报.jpg" width="1000"/>
		</a>