@@ -56,47 +56,47 @@ endif::[]
56
56
|✅ 快慢指针
57
57
58
58
|{counter:codes2503}
59
- |{leetcode_base_url} /minimum-window-substring/[76. Minimum Window Substring ^]
59
+ |{leetcode_base_url} /minimum-window-substring/[76. 最小覆盖子串 ^]
60
60
|{doc_base_url} /0076-minimum-window-substring.adoc[题解]
61
61
|⭕️ 滑动窗口,一定注意细节的处理。
62
62
63
63
|{counter:codes2503}
64
- |{leetcode_base_url} /remove-duplicate-letters/[316. Remove Duplicate Letters ^]
64
+ |{leetcode_base_url} /remove-duplicate-letters/[316. 去除重复字母 ^]
65
65
|{doc_base_url} /0316-remove-duplicate-letters.adoc[题解]
66
66
|❌ 完全想不到单调栈!
67
67
68
68
|{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 个高频元素 ^]
70
70
|{doc_base_url} /0347-top-k-frequent-elements.adoc[题解]
71
71
|✅ Top K 问题,优先队列;桶排序
72
72
73
73
|{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个最大元素 ^]
75
75
|{doc_base_url} /0215-kth-largest-element-in-an-array.adoc[题解]
76
76
|⭕️ 快速选择,想清楚边界情况!
77
77
78
78
|{counter:codes2503}
79
- |{leetcode_base_url} /first-missing-positive/[41. First Missing Positive ^]
79
+ |{leetcode_base_url} /first-missing-positive/[41. 缺失的第一个正数 ^]
80
80
|{doc_base_url} /0041-first-missing-positive.adoc[题解]
81
81
|⭕️ 循环排序,看了答案,自己写出来了。
82
82
83
83
|{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. 数据流的中位数 ^]
85
85
|{doc_base_url} /0295-find-median-from-data-stream.adoc[题解]
86
86
|⭕️ 双堆,思路理解,写代码却有很多问题。
87
87
88
88
|{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 个升序链表 ^]
90
90
|{doc_base_url} /0023-merge-k-sorted-lists.adoc[题解]
91
91
|✅ 多路归并
92
92
93
93
|{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. 二叉树的层序遍历 ^]
95
95
|{doc_base_url} /0102-binary-tree-level-order-traversal.adoc[题解]
96
96
|✅ 广度优先搜索
97
97
98
98
|{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. 二叉树中的最大路径和 ^]
100
100
|{doc_base_url} /0124-binary-tree-maximum-path-sum.adoc[题解]
101
101
|⭕️ 深度优先搜索,注意处理负数情况
102
102
0 commit comments