Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Appearance settings

Commit 76a7af8

Browse filesBrowse files
2xiao2xiao
committed
add 23 solutions
1 parent 40f8a6d commit 76a7af8
Copy full SHA for 76a7af8

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.
Dismiss banner

68 files changed

+3732
-94
lines changed

‎src/.vuepress/sidebar.ts

Copy file name to clipboardExpand all lines: src/.vuepress/sidebar.ts
+23Lines changed: 23 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -137,6 +137,7 @@ export default sidebar({
137137
"0116",
138138
"0117",
139139
"0118",
140+
"0119",
140141
"0120",
141142
"0121",
142143
"0122",
@@ -148,13 +149,15 @@ export default sidebar({
148149
"0129",
149150
"0130",
150151
"0131",
152+
"0132",
151153
"0133",
152154
"0134",
153155
"0135",
154156
"0136",
155157
"0137",
156158
"0138",
157159
"0139",
160+
"0140",
158161
"0141",
159162
"0142",
160163
"0143",
@@ -300,13 +303,20 @@ export default sidebar({
300303
"collapsible": true,
301304
"children": [
302305
"0400",
306+
"0401",
307+
"0404",
308+
"0405",
309+
"0409",
310+
"0412",
311+
"0414",
303312
"0415",
304313
"0416",
305314
"0426",
306315
"0427",
307316
"0430",
308317
"0432",
309318
"0433",
319+
"0434",
310320
"0435",
311321
"0436",
312322
"0437",
@@ -316,13 +326,21 @@ export default sidebar({
316326
"0442",
317327
"0443",
318328
"0445",
329+
"0448",
319330
"0450",
320331
"0451",
321332
"0452",
333+
"0455",
334+
"0458",
322335
"0459",
323336
"0460",
337+
"0461",
338+
"0463",
324339
"0474",
340+
"0476",
341+
"0482",
325342
"0485",
343+
"0492",
326344
"0494",
327345
"0496",
328346
"0498"
@@ -353,6 +371,7 @@ export default sidebar({
353371
"0584",
354372
"0589",
355373
"0590",
374+
"0594",
356375
"0595"
357376
]
358377
},
@@ -451,6 +470,7 @@ export default sidebar({
451470
"children": [
452471
"1004",
453472
"1008",
473+
"1009",
454474
"1021",
455475
"1047",
456476
"1049",
@@ -594,6 +614,7 @@ export default sidebar({
594614
"children": [
595615
"2109",
596616
"2130",
617+
"2182",
597618
"2196"
598619
]
599620
},
@@ -602,6 +623,7 @@ export default sidebar({
602623
"collapsible": true,
603624
"children": [
604625
"2215",
626+
"2220",
605627
"2257",
606628
"2259",
607629
"2260",
@@ -628,6 +650,7 @@ export default sidebar({
628650
"children": [
629651
"2405",
630652
"2406",
653+
"2410",
631654
"2416",
632655
"2458",
633656
"2461",

‎src/book/bit.md

Copy file name to clipboardExpand all lines: src/book/bit.md
+2-2Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -11,9 +11,9 @@
1111
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
1212
| :------: | :------ | :------: | :------ | :------: | :------: |
1313
| 504 | 七进制数 | | [`数学`](/tag/math.md) | 🟢 | [🀄️](https://leetcode.cn/problems/base-7) [🔗](https://leetcode.com/problems/base-7) |
14-
| 405 | 数字转换为十六进制数 | | [`位运算`](/tag/bit-manipulation.md) [`数学`](/tag/math.md) | 🟢 | [🀄️](https://leetcode.cn/problems/convert-a-number-to-hexadecimal) [🔗](https://leetcode.com/problems/convert-a-number-to-hexadecimal) |
14+
| 405 | 数字转换为十六进制数 | [[✓]](/problem/0405.md) | [`位运算`](/tag/bit-manipulation.md) [`数学`](/tag/math.md) | 🟢 | [🀄️](https://leetcode.cn/problems/convert-a-number-to-hexadecimal) [🔗](https://leetcode.com/problems/convert-a-number-to-hexadecimal) |
1515
| 190 | 颠倒二进制位 | [[✓]](/problem/0190.md) | [`位运算`](/tag/bit-manipulation.md) [`分治`](/tag/divide-and-conquer.md) | 🟢 | [🀄️](https://leetcode.cn/problems/reverse-bits) [🔗](https://leetcode.com/problems/reverse-bits) |
16-
| 1009 | 十进制整数的反码 | | [`位运算`](/tag/bit-manipulation.md) | 🟢 | [🀄️](https://leetcode.cn/problems/complement-of-base-10-integer) [🔗](https://leetcode.com/problems/complement-of-base-10-integer) |
16+
| 1009 | 十进制整数的反码 | [[✓]](/problem/1009.md) | [`位运算`](/tag/bit-manipulation.md) | 🟢 | [🀄️](https://leetcode.cn/problems/complement-of-base-10-integer) [🔗](https://leetcode.com/problems/complement-of-base-10-integer) |
1717
| 191 | 位1的个数 | [[✓]](/problem/0191.md) | [`位运算`](/tag/bit-manipulation.md) [`分治`](/tag/divide-and-conquer.md) | 🟢 | [🀄️](https://leetcode.cn/problems/number-of-1-bits) [🔗](https://leetcode.com/problems/number-of-1-bits) |
1818
| 371 | 两整数之和 | | [`位运算`](/tag/bit-manipulation.md) [`数学`](/tag/math.md) | 🟠 | [🀄️](https://leetcode.cn/problems/sum-of-two-integers) [🔗](https://leetcode.com/problems/sum-of-two-integers) |
1919
| 89 | 格雷编码 | | [`位运算`](/tag/bit-manipulation.md) [`数学`](/tag/math.md) [`回溯`](/tag/backtracking.md) | 🟠 | [🀄️](https://leetcode.cn/problems/gray-code) [🔗](https://leetcode.com/problems/gray-code) |

‎src/book/dynamic_programming.md

Copy file name to clipboardExpand all lines: src/book/dynamic_programming.md
+2-2Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -86,7 +86,7 @@
8686
| 413 | 等差数列划分 | | [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/arithmetic-slices) [🔗](https://leetcode.com/problems/arithmetic-slices) |
8787
| 91 | 解码方法 | | [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/decode-ways) [🔗](https://leetcode.com/problems/decode-ways) |
8888
| 639 | 解码方法 II | | [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/decode-ways-ii) [🔗](https://leetcode.com/problems/decode-ways-ii) |
89-
| 132 | 分割回文串 II | | [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/palindrome-partitioning-ii) [🔗](https://leetcode.com/problems/palindrome-partitioning-ii) |
89+
| 132 | 分割回文串 II | [[✓]](/problem/0132.md) | [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/palindrome-partitioning-ii) [🔗](https://leetcode.com/problems/palindrome-partitioning-ii) |
9090
| 1220 | 统计元音字母序列的数目 | | [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/count-vowels-permutation) [🔗](https://leetcode.com/problems/count-vowels-permutation) |
9191
| 338 | 比特位计数 | [[✓]](/problem/0338.md) | [`位运算`](/tag/bit-manipulation.md) [`动态规划`](/tag/dynamic-programming.md) | 🟢 | [🀄️](https://leetcode.cn/problems/counting-bits) [🔗](https://leetcode.com/problems/counting-bits) |
9292
| 801 | 使序列递增的最小交换次数 | | [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/minimum-swaps-to-make-sequences-increasing) [🔗](https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing) |
@@ -133,7 +133,7 @@
133133
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
134134
| :------: | :------ | :------: | :------ | :------: | :------: |
135135
| 118 | 杨辉三角 | [[✓]](/problem/0118.md) | [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟢 | [🀄️](https://leetcode.cn/problems/pascals-triangle) [🔗](https://leetcode.com/problems/pascals-triangle) |
136-
| 119 | 杨辉三角 II | | [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟢 | [🀄️](https://leetcode.cn/problems/pascals-triangle-ii) [🔗](https://leetcode.com/problems/pascals-triangle-ii) |
136+
| 119 | 杨辉三角 II | [[✓]](/problem/0119.md) | [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟢 | [🀄️](https://leetcode.cn/problems/pascals-triangle-ii) [🔗](https://leetcode.com/problems/pascals-triangle-ii) |
137137
| 120 | 三角形最小路径和 | [[✓]](/problem/0120.md) | [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/triangle) [🔗](https://leetcode.com/problems/triangle) |
138138
| 64 | 最小路径和 | [[✓]](/problem/0064.md) | [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) [`矩阵`](/tag/matrix.md) | 🟠 | [🀄️](https://leetcode.cn/problems/minimum-path-sum) [🔗](https://leetcode.com/problems/minimum-path-sum) |
139139
| 174 | 地下城游戏 | [[✓]](/problem/0174.md) | [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) [`矩阵`](/tag/matrix.md) | 🔴 | [🀄️](https://leetcode.cn/problems/dungeon-game) [🔗](https://leetcode.com/problems/dungeon-game) |

‎src/book/greedy.md

Copy file name to clipboardExpand all lines: src/book/greedy.md
+1-1Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -22,7 +22,7 @@
2222
<!-- prettier-ignore -->
2323
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
2424
| :------: | :------ | :------: | :------ | :------: | :------: |
25-
| 455 | 分发饼干 | | [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/assign-cookies) [🔗](https://leetcode.com/problems/assign-cookies) |
25+
| 455 | 分发饼干 | [[✓]](/problem/0455.md) | [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/assign-cookies) [🔗](https://leetcode.com/problems/assign-cookies) |
2626
| 860 | 柠檬水找零 | | [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) | 🟢 | [🀄️](https://leetcode.cn/problems/lemonade-change) [🔗](https://leetcode.com/problems/lemonade-change) |
2727
| 56 | 合并区间 | [[✓]](/problem/0056.md) | [`数组`](/tag/array.md) [`排序`](/tag/sorting.md) | 🟠 | [🀄️](https://leetcode.cn/problems/merge-intervals) [🔗](https://leetcode.com/problems/merge-intervals) |
2828
| 435 | 无重叠区间 | [[✓]](/problem/0435.md) | [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/non-overlapping-intervals) [🔗](https://leetcode.com/problems/non-overlapping-intervals) |

‎src/book/recursion.md

Copy file name to clipboardExpand all lines: src/book/recursion.md
+1-1Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -40,7 +40,7 @@ function f(n) {
4040
| 344 | 反转字符串 | [[✓]](/problem/0344.md) | [`双指针`](/tag/two-pointers.md) [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/reverse-string) [🔗](https://leetcode.com/problems/reverse-string) |
4141
| 24 | 两两交换链表中的节点 | [[✓]](/problem/0024.md) | [`递归`](/tag/recursion.md) [`链表`](/tag/linked-list.md) | 🟠 | [🀄️](https://leetcode.cn/problems/swap-nodes-in-pairs) [🔗](https://leetcode.com/problems/swap-nodes-in-pairs) |
4242
| 118 | 杨辉三角 | [[✓]](/problem/0118.md) | [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟢 | [🀄️](https://leetcode.cn/problems/pascals-triangle) [🔗](https://leetcode.com/problems/pascals-triangle) |
43-
| 119 | 杨辉三角 II | | [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟢 | [🀄️](https://leetcode.cn/problems/pascals-triangle-ii) [🔗](https://leetcode.com/problems/pascals-triangle-ii) |
43+
| 119 | 杨辉三角 II | [[✓]](/problem/0119.md) | [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟢 | [🀄️](https://leetcode.cn/problems/pascals-triangle-ii) [🔗](https://leetcode.com/problems/pascals-triangle-ii) |
4444
| 206 | 反转链表 | [[✓]](/problem/0206.md) | [`递归`](/tag/recursion.md) [`链表`](/tag/linked-list.md) | 🟢 | [🀄️](https://leetcode.cn/problems/reverse-linked-list) [🔗](https://leetcode.com/problems/reverse-linked-list) |
4545
| 92 | 反转链表 II | [[✓]](/problem/0092.md) | [`链表`](/tag/linked-list.md) | 🟠 | [🀄️](https://leetcode.cn/problems/reverse-linked-list-ii) [🔗](https://leetcode.com/problems/reverse-linked-list-ii) |
4646
| 21 | 合并两个有序链表 | [[✓]](/problem/0021.md) | [`递归`](/tag/recursion.md) [`链表`](/tag/linked-list.md) | 🟢 | [🀄️](https://leetcode.cn/problems/merge-two-sorted-lists) [🔗](https://leetcode.com/problems/merge-two-sorted-lists) |

‎src/plan/company_list.md

Copy file name to clipboardExpand all lines: src/plan/company_list.md
+2-2Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -49,7 +49,7 @@ headerDepth: 0
4949
| 538 | 把二叉搜索树转换为累加树 | | [`树`](/tag/tree.md) [`深度优先搜索`](/tag/depth-first-search.md) [`二叉搜索树`](/tag/binary-search-tree.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/convert-bst-to-greater-tree) [🔗](https://leetcode.com/problems/convert-bst-to-greater-tree) | 8 |
5050
| 2184 | 建造坚实的砖墙的方法数 🔒 | | [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/number-of-ways-to-build-sturdy-brick-wall) [🔗](https://leetcode.com/problems/number-of-ways-to-build-sturdy-brick-wall) | 8 |
5151
| 841 | 钥匙和房间 | [[✓]](/problem/0841.md) | [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`图`](/tag/graph.md) | 🟠 | [🀄️](https://leetcode.cn/problems/keys-and-rooms) [🔗](https://leetcode.com/problems/keys-and-rooms) | 5 |
52-
| 463 | 岛屿的周长 | | [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`数组`](/tag/array.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/island-perimeter) [🔗](https://leetcode.com/problems/island-perimeter) | 4 |
52+
| 463 | 岛屿的周长 | [[✓]](/problem/0463.md) | [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`数组`](/tag/array.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/island-perimeter) [🔗](https://leetcode.com/problems/island-perimeter) | 4 |
5353
| 1568 | 使陆地分离的最少天数 | | [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`数组`](/tag/array.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/minimum-number-of-days-to-disconnect-island) [🔗](https://leetcode.com/problems/minimum-number-of-days-to-disconnect-island) | 2 |
5454

5555

@@ -182,7 +182,7 @@ headerDepth: 0
182182
| 799 | 香槟塔 | | [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/champagne-tower) [🔗](https://leetcode.com/problems/champagne-tower) | 3 |
183183
| 387 | 字符串中的第一个唯一字符 | [[✓]](/problem/0387.md) | [`队列`](/tag/queue.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/first-unique-character-in-a-string) [🔗](https://leetcode.com/problems/first-unique-character-in-a-string) | 3 |
184184
| 155 | 最小栈 | [[✓]](/problem/0155.md) | [`栈`](/tag/stack.md) [`设计`](/tag/design.md) | 🟠 | [🀄️](https://leetcode.cn/problems/min-stack) [🔗](https://leetcode.com/problems/min-stack) | 3 |
185-
| 140 | 单词拆分 II | | [`字典树`](/tag/trie.md) [`记忆化搜索`](/tag/memoization.md) [`数组`](/tag/array.md) `4+` | 🔴 | [🀄️](https://leetcode.cn/problems/word-break-ii) [🔗](https://leetcode.com/problems/word-break-ii) | 2 |
185+
| 140 | 单词拆分 II | [[✓]](/problem/0140.md) | [`字典树`](/tag/trie.md) [`记忆化搜索`](/tag/memoization.md) [`数组`](/tag/array.md) `4+` | 🔴 | [🀄️](https://leetcode.cn/problems/word-break-ii) [🔗](https://leetcode.com/problems/word-break-ii) | 2 |
186186
| 828 | 统计子串中的唯一字符 | | [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/count-unique-characters-of-all-substrings-of-a-given-string) [🔗](https://leetcode.com/problems/count-unique-characters-of-all-substrings-of-a-given-string) | 2 |
187187

188188

0 commit comments

Comments
0 (0)
Morty Proxy This is a proxified and sanitized view of the page, visit original site.