You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: readme/301-600.md
+6-6Lines changed: 6 additions & 6 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -61,19 +61,19 @@ LeetCode Problems' Solutions
61
61
| <spanid="305">305</span> |[Number of Islands II](https://leetcode.com/problems/number-of-islands-ii"岛屿数量 II") 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/number-of-islands-ii)| Hard |
62
62
| <spanid="306">306</span> |[Additive Number](https://leetcode.com/problems/additive-number"累加数")|[Go](https://github.com/openset/leetcode/tree/master/problems/additive-number)| Medium |
63
63
| <spanid="307">307</span> |[Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable"区域和检索 - 数组可修改")|[Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-mutable)| Medium |
64
-
| <spanid="308">308</span> |[Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable"二维区域和检索 - 可变") 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-mutable)| Hard |
64
+
| <spanid="308">308</span> |[Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable"二维区域检索求和(可变的)") 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-mutable)| Hard |
65
65
| <spanid="309">309</span> |[Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown"最佳买卖股票时机含冷冻期")|[Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-with-cooldown)| Medium |
66
66
| <spanid="310">310</span> |[Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees"最小高度树")|[Go](https://github.com/openset/leetcode/tree/master/problems/minimum-height-trees)| Medium |
67
67
| <spanid="311">311</span> |[Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication"稀疏矩阵的乘法") 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/sparse-matrix-multiplication)| Medium |
68
68
| <spanid="312">312</span> |[Burst Balloons](https://leetcode.com/problems/burst-balloons"戳气球")|[Go](https://github.com/openset/leetcode/tree/master/problems/burst-balloons)| Hard |
69
69
| <spanid="313">313</span> |[Super Ugly Number](https://leetcode.com/problems/super-ugly-number"超级丑数")|[Go](https://github.com/openset/leetcode/tree/master/problems/super-ugly-number)| Medium |
70
-
| <spanid="314">314</span> |[Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal"二叉树的垂直遍历") 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-vertical-order-traversal)| Medium |
70
+
| <spanid="314">314</span> |[Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal"二叉树竖直遍历") 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-vertical-order-traversal)| Medium |
71
71
| <spanid="315">315</span> |[Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self"计算右侧小于当前元素的个数")|[Go](https://github.com/openset/leetcode/tree/master/problems/count-of-smaller-numbers-after-self)| Hard |
72
72
| <spanid="316">316</span> |[Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters"去除重复字母")|[Go](https://github.com/openset/leetcode/tree/master/problems/remove-duplicate-letters)| Hard |
73
-
| <spanid="317">317</span> |[Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings"离建筑物最近的距离") 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-from-all-buildings)| Hard |
73
+
| <spanid="317">317</span> |[Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings"建筑物的最短距离") 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-from-all-buildings)| Hard |
74
74
| <spanid="318">318</span> |[Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths"最大单词长度乘积")|[Go](https://github.com/openset/leetcode/tree/master/problems/maximum-product-of-word-lengths)| Medium |
75
75
| <spanid="319">319</span> |[Bulb Switcher](https://leetcode.com/problems/bulb-switcher"灯泡开关")|[Go](https://github.com/openset/leetcode/tree/master/problems/bulb-switcher)| Medium |
76
-
| <spanid="320">320</span> |[Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation"列举单词的全部缩写") 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/generalized-abbreviation)| Medium |
76
+
| <spanid="320">320</span> |[Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation"列举缩写") 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/generalized-abbreviation)| Medium |
77
77
| <spanid="321">321</span> |[Create Maximum Number](https://leetcode.com/problems/create-maximum-number"拼接最大数")|[Go](https://github.com/openset/leetcode/tree/master/problems/create-maximum-number)| Hard |
78
78
| <spanid="322">322</span> |[Coin Change](https://leetcode.com/problems/coin-change"零钱兑换")|[Go](https://github.com/openset/leetcode/tree/master/problems/coin-change)| Medium |
79
79
| <spanid="323">323</span> |[Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph"无向图中连通分量的数目") 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/number-of-connected-components-in-an-undirected-graph)| Medium |
| <spanid="350">350</span> |[Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii"两个数组的交集 II")|[Go](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays-ii)| Easy |
107
107
| <spanid="351">351</span> |[Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns"安卓系统手势解锁") 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/android-unlock-patterns)| Medium |
108
108
| <spanid="352">352</span> |[Data Stream as Disjoint Intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals"将数据流变为多个不相交区间")|[Go](https://github.com/openset/leetcode/tree/master/problems/data-stream-as-disjoint-intervals)| Hard |
109
-
| <spanid="353">353</span> |[Design Snake Game](https://leetcode.com/problems/design-snake-game"贪吃蛇") 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/design-snake-game)| Medium |
109
+
| <spanid="353">353</span> |[Design Snake Game](https://leetcode.com/problems/design-snake-game"贪吃蛇判定器") 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/design-snake-game)| Medium |
110
110
| <spanid="354">354</span> |[Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes"俄罗斯套娃信封问题")|[Go](https://github.com/openset/leetcode/tree/master/problems/russian-doll-envelopes)| Hard |
111
111
| <spanid="355">355</span> |[Design Twitter](https://leetcode.com/problems/design-twitter"设计推特")|[Go](https://github.com/openset/leetcode/tree/master/problems/design-twitter)| Medium |
112
112
| <spanid="356">356</span> |[Line Reflection](https://leetcode.com/problems/line-reflection"直线镜像") 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/line-reflection)| Medium |
113
113
| <spanid="357">357</span> |[Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits"计算各个位数不同的数字个数")|[Go](https://github.com/openset/leetcode/tree/master/problems/count-numbers-with-unique-digits)| Medium |
114
-
| <spanid="358">358</span> |[Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart"K 距离间隔重排字符串") 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/rearrange-string-k-distance-apart)| Hard |
114
+
| <spanid="358">358</span> |[Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart"k 距离重排字符串") 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/rearrange-string-k-distance-apart)| Hard |
| 357 |[计算各个位数不同的数字个数](https://github.com/openset/leetcode/tree/master/problems/count-numbers-with-unique-digits)|[[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)][[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)][[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)]| Medium |
22
22
| 351 |[安卓系统手势解锁](https://github.com/openset/leetcode/tree/master/problems/android-unlock-patterns) 🔒 |[[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)][[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)]| Medium |
23
-
| 320 |[列举单词的全部缩写](https://github.com/openset/leetcode/tree/master/problems/generalized-abbreviation) 🔒 |[[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)][[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)]| Medium |
23
+
| 320 |[列举缩写](https://github.com/openset/leetcode/tree/master/problems/generalized-abbreviation) 🔒 |[[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)][[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)]| Medium |
24
24
| 306 |[累加数](https://github.com/openset/leetcode/tree/master/problems/additive-number)|[[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)]| Medium |
25
25
| 294 |[翻转游戏 II](https://github.com/openset/leetcode/tree/master/problems/flip-game-ii) 🔒 |[[极小化极大](https://github.com/openset/leetcode/tree/master/tag/minimax/README.md)][[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)]| Medium |
26
26
| 291 |[单词规律 II](https://github.com/openset/leetcode/tree/master/problems/word-pattern-ii) 🔒 |[[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)]| Hard |
Copy file name to clipboardExpand all lines: tag/binary-indexed-tree/README.md
+1-1Lines changed: 1 addition & 1 deletion
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -12,6 +12,6 @@
12
12
| 493 |[翻转对](https://github.com/openset/leetcode/tree/master/problems/reverse-pairs)|[[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)][[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)][[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)][[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)][[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)]| Hard |
13
13
| 327 |[区间和的个数](https://github.com/openset/leetcode/tree/master/problems/count-of-range-sum)|[[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)][[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)][[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)][[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)][[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)]| Hard |
14
14
| 315 |[计算右侧小于当前元素的个数](https://github.com/openset/leetcode/tree/master/problems/count-of-smaller-numbers-after-self)|[[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)][[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)][[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)][[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)][[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)]| Hard |
15
-
| 308 |[二维区域和检索 - 可变](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-mutable) 🔒 |[[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)][[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)]| Hard |
15
+
| 308 |[二维区域检索求和(可变的)](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-mutable) 🔒 |[[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)][[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)]| Hard |
16
16
| 307 |[区域和检索 - 数组可修改](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-mutable)|[[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)][[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)]| Medium |
17
17
| 218 |[天际线问题](https://github.com/openset/leetcode/tree/master/problems/the-skyline-problem)|[[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)][[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)][[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)][[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)][[Line Sweep](https://github.com/openset/leetcode/tree/master/tag/line-sweep/README.md)]| Hard |
| 338 |[比特位计数](https://github.com/openset/leetcode/tree/master/problems/counting-bits)|[[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)][[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)]| Medium |
31
-
| 320 |[列举单词的全部缩写](https://github.com/openset/leetcode/tree/master/problems/generalized-abbreviation) 🔒 |[[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)][[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)]| Medium |
31
+
| 320 |[列举缩写](https://github.com/openset/leetcode/tree/master/problems/generalized-abbreviation) 🔒 |[[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)][[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)]| Medium |
32
32
| 318 |[最大单词长度乘积](https://github.com/openset/leetcode/tree/master/problems/maximum-product-of-word-lengths)|[[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)]| Medium |
Copy file name to clipboardExpand all lines: tag/breadth-first-search/README.md
+1-1Lines changed: 1 addition & 1 deletion
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -39,7 +39,7 @@
39
39
| 417 |[太平洋大西洋水流问题](https://github.com/openset/leetcode/tree/master/problems/pacific-atlantic-water-flow)|[[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)][[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)]| Medium |
40
40
| 407 |[接雨水 II](https://github.com/openset/leetcode/tree/master/problems/trapping-rain-water-ii)|[[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)][[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)]| Hard |
41
41
| 323 |[无向图中连通分量的数目](https://github.com/openset/leetcode/tree/master/problems/number-of-connected-components-in-an-undirected-graph) 🔒 |[[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)][[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)][[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)][[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)]| Medium |
42
-
| 317 |[离建筑物最近的距离](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-from-all-buildings) 🔒 |[[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)]| Hard |
42
+
| 317 |[建筑物的最短距离](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-from-all-buildings) 🔒 |[[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)]| Hard |
43
43
| 310 |[最小高度树](https://github.com/openset/leetcode/tree/master/problems/minimum-height-trees)|[[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)][[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)]| Medium |
44
44
| 301 |[删除无效的括号](https://github.com/openset/leetcode/tree/master/problems/remove-invalid-parentheses)|[[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)][[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)]| Hard |
45
45
| 286 |[墙与门](https://github.com/openset/leetcode/tree/master/problems/walls-and-gates) 🔒 |[[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)]| Medium |
0 commit comments