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

0018 Java代码部分增加剪枝操作,不然Leetcode不能通过

Browse Source
This commit is contained in:
AronJudge
2022-07-04 00:58:56 +08:00
parent ffe981fb6c
commit 11b701fdb6
1 changed files with 5 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -140,6 +140,11 @@ class Solution {
for (int i = 0; i < nums.length; i++) { for (int i = 0; i < nums.length; i++) {
// nums[i] > target 直接返回, 剪枝操作
if (nums[i] > 0 && nums[i] > target) {
return result;
}
if (i > 0 && nums[i - 1] == nums[i]) { if (i > 0 && nums[i - 1] == nums[i]) {
continue; continue;
} }