Skip to content

Commit 45468fd

Browse files
committed
增加说明,汉化标题
1 parent d1ecd07 commit 45468fd

File tree

2 files changed

+11
-9
lines changed

2 files changed

+11
-9
lines changed

logbook/202503.adoc

Lines changed: 9 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -56,47 +56,47 @@ endif::[]
5656
|✅ 快慢指针
5757

5858
|{counter:codes2503}
59-
|{leetcode_base_url}/minimum-window-substring/[76. Minimum Window Substring^]
59+
|{leetcode_base_url}/minimum-window-substring/[76. 最小覆盖子串^]
6060
|{doc_base_url}/0076-minimum-window-substring.adoc[题解]
6161
|⭕️ 滑动窗口,一定注意细节的处理。
6262

6363
|{counter:codes2503}
64-
|{leetcode_base_url}/remove-duplicate-letters/[316. Remove Duplicate Letters^]
64+
|{leetcode_base_url}/remove-duplicate-letters/[316. 去除重复字母^]
6565
|{doc_base_url}/0316-remove-duplicate-letters.adoc[题解]
6666
|❌ 完全想不到单调栈!
6767

6868
|{counter:codes2503}
69-
|{leetcode_base_url}/top-k-frequent-elements/[347. Top K Frequent Elements^]
69+
|{leetcode_base_url}/top-k-frequent-elements/[347. K 个高频元素^]
7070
|{doc_base_url}/0347-top-k-frequent-elements.adoc[题解]
7171
|✅ Top K 问题,优先队列;桶排序
7272

7373
|{counter:codes2503}
74-
|{leetcode_base_url}/kth-largest-element-in-an-array/[215. Kth Largest Element in an Array^]
74+
|{leetcode_base_url}/kth-largest-element-in-an-array/[215. 数组中的第K个最大元素^]
7575
|{doc_base_url}/0215-kth-largest-element-in-an-array.adoc[题解]
7676
|⭕️ 快速选择,想清楚边界情况!
7777

7878
|{counter:codes2503}
79-
|{leetcode_base_url}/first-missing-positive/[41. First Missing Positive^]
79+
|{leetcode_base_url}/first-missing-positive/[41. 缺失的第一个正数^]
8080
|{doc_base_url}/0041-first-missing-positive.adoc[题解]
8181
|⭕️ 循环排序,看了答案,自己写出来了。
8282

8383
|{counter:codes2503}
84-
|{leetcode_base_url}/find-median-from-data-stream/[295. Find Median from Data Stream^]
84+
|{leetcode_base_url}/find-median-from-data-stream/[295. 数据流的中位数^]
8585
|{doc_base_url}/0295-find-median-from-data-stream.adoc[题解]
8686
|⭕️ 双堆,思路理解,写代码却有很多问题。
8787

8888
|{counter:codes2503}
89-
|{leetcode_base_url}/merge-k-sorted-lists/[23. Merge k Sorted Lists^]
89+
|{leetcode_base_url}/merge-k-sorted-lists/[23. 合并 K 个升序链表^]
9090
|{doc_base_url}/0023-merge-k-sorted-lists.adoc[题解]
9191
|✅ 多路归并
9292

9393
|{counter:codes2503}
94-
|{leetcode_base_url}/binary-tree-level-order-traversal/[102. Binary Tree Level Order Traversal^]
94+
|{leetcode_base_url}/binary-tree-level-order-traversal/[102. 二叉树的层序遍历^]
9595
|{doc_base_url}/0102-binary-tree-level-order-traversal.adoc[题解]
9696
|✅ 广度优先搜索
9797

9898
|{counter:codes2503}
99-
|{leetcode_base_url}/binary-tree-maximum-path-sum/[124. Binary Tree Maximum Path Sum^]
99+
|{leetcode_base_url}/binary-tree-maximum-path-sum/[124. 二叉树中的最大路径和^]
100100
|{doc_base_url}/0124-binary-tree-maximum-path-sum.adoc[题解]
101101
|⭕️ 深度优先搜索,注意处理负数情况
102102

src/main/java/com/diguage/algo/leetcode/_0124_BinaryTreeMaximumPathSum_2.java

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -19,6 +19,8 @@ private int dfs(TreeNode root) {
1919
if (root == null) {
2020
return 0;
2121
}
22+
// 这里可以利用 Math.max(0, dfs(root.right)) 简化代码。
23+
// 但是,不简化可以击败 100%,简化后如一刷解法,却只能击败 49.84%
2224
int left = dfs(root.left);
2325
int right = dfs(root.right);
2426
// 对于左右子树,这里有如下几种组合

0 commit comments

Comments
 (0)