Update 0018.四数之和.md

add 剪枝 to the second for loop
2024-06-27 07:33:01 -04:00 · 2024-06-27 07:33:01 -04:00 · 718d3c065a
parent 240684f35e
commit 718d3c065a
1 changed files with 5 additions and 0 deletions
--- a/problems/0018.四数之和.md
+++ b/problems/0018.四数之和.md
@ -262,6 +262,11 @@ class Solution {
            
            for (int j = i + 1; j < nums.length; j++) {

+		// nums[i]+nums[j] > target 直接返回, 剪枝操作
+		            if (nums[i]+nums[j] > 0 && nums[i]+nums[j] > target) {
+		                return result;
+		            }
+
                if (j > i + 1 && nums[j - 1] == nums[j]) {  // 对nums[j]去重
                    continue;
                }