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
Sign up
Appearance settings

Commit 4c6c701

Browse files
author
Shuo
authored
Merge pull request #564 from openset/develop
Add: new
2 parents e6da31b + aa407fe commit 4c6c701

File tree

9 files changed

+15
-8
lines changed

9 files changed

+15
-8
lines changed

‎readme/1-300.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -78,7 +78,7 @@ LeetCode Problems' Solutions
7878
| <span id="22">22</span> | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses "括号生成") | [Go](https://github.com/openset/leetcode/tree/master/problems/generate-parentheses) | Medium |
7979
| <span id="23">23</span> | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists "合并K个排序链表") | [Go](https://github.com/openset/leetcode/tree/master/problems/merge-k-sorted-lists) | Hard |
8080
| <span id="24">24</span> | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs "两两交换链表中的节点") | [Go](https://github.com/openset/leetcode/tree/master/problems/swap-nodes-in-pairs) | Medium |
81-
| <span id="25">25</span> | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group "k个一组翻转链表") | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-nodes-in-k-group) | Hard |
81+
| <span id="25">25</span> | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group "K 个一组翻转链表") | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-nodes-in-k-group) | Hard |
8282
| <span id="26">26</span> | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array "删除排序数组中的重复项") | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-array) | Easy |
8383
| <span id="27">27</span> | [Remove Element](https://leetcode.com/problems/remove-element "移除元素") | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-element) | Easy |
8484
| <span id="28">28</span> | [Implement strStr()](https://leetcode.com/problems/implement-strstr "实现strStr()") | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-strstr) | Easy |

‎tag/README.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -20,7 +20,7 @@
2020
| 17 | [Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md) | [位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md) | | 18 | [Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md) | [排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md) |
2121
| 19 | [Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md) | [图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md) | | 20 | [Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md) | [并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md) |
2222
| 21 | [Divide and Conquer](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md) | [分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md) | | 22 | [Trie](https://github.com/openset/leetcode/tree/master/tag/trie/README.md) | [字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md) |
23-
| 23 | [Recursion](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md) | [递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md) | | 24 | [Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md) | [Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md) |
23+
| 23 | [Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md) | [Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md) | | 24 | [Recursion](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md) | [递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md) |
2424
| 25 | [Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md) | [Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md) | | 26 | [Segment Tree](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md) | [线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md) |
2525
| 27 | [Queue](https://github.com/openset/leetcode/tree/master/tag/queue/README.md) | [队列](https://github.com/openset/leetcode/tree/master/tag/queue/README.md) | | 28 | [Minimax](https://github.com/openset/leetcode/tree/master/tag/minimax/README.md) | [极小化极大](https://github.com/openset/leetcode/tree/master/tag/minimax/README.md) |
2626
| 29 | [Binary Indexed Tree](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md) | [树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md) | | 30 | [Random](https://github.com/openset/leetcode/tree/master/tag/random/README.md) | [Random](https://github.com/openset/leetcode/tree/master/tag/random/README.md) |

‎tag/array/README.md‎

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -9,6 +9,9 @@
99

1010
| # | 题名 | 标签 | 难度 |
1111
| :-: | - | - | :-: |
12+
| 1053 | [交换一次的先前排列](https://github.com/openset/leetcode/tree/master/problems/previous-permutation-with-one-swap) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium |
13+
| 1052 | [爱生气的书店老板](https://github.com/openset/leetcode/tree/master/problems/grumpy-bookstore-owner) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium |
14+
| 1051 | [高度检查器](https://github.com/openset/leetcode/tree/master/problems/height-checker) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy |
1215
| 1040 | [移动石子直到连续 II](https://github.com/openset/leetcode/tree/master/problems/moving-stones-until-consecutive-ii) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium |
1316
| 1035 | [不相交的线](https://github.com/openset/leetcode/tree/master/problems/uncrossed-lines) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium |
1417
| 1031 | [两个非重叠子数组的最大和](https://github.com/openset/leetcode/tree/master/problems/maximum-sum-of-two-non-overlapping-subarrays) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium |

‎tag/greedy/README.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -9,6 +9,7 @@
99

1010
| # | 题名 | 标签 | 难度 |
1111
| :-: | - | - | :-: |
12+
| 1053 | [交换一次的先前排列](https://github.com/openset/leetcode/tree/master/problems/previous-permutation-with-one-swap) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium |
1213
| 1046 | [最后一块石头的重量](https://github.com/openset/leetcode/tree/master/problems/last-stone-weight) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Easy |
1314
| 1029 | [两地调度](https://github.com/openset/leetcode/tree/master/problems/two-city-scheduling) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Easy |
1415
| 1007 | [行相等的最少多米诺旋转](https://github.com/openset/leetcode/tree/master/problems/minimum-domino-rotations-for-equal-row) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium |

‎tag/heap/README.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -9,6 +9,7 @@
99

1010
| # | 题名 | 标签 | 难度 |
1111
| :-: | - | - | :-: |
12+
| 1054 | [距离相等的条形码](https://github.com/openset/leetcode/tree/master/problems/distant-barcodes) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] | Medium |
1213
| 1046 | [最后一块石头的重量](https://github.com/openset/leetcode/tree/master/problems/last-stone-weight) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Easy |
1314
| 973 | [最接近原点的 K 个点](https://github.com/openset/leetcode/tree/master/problems/k-closest-points-to-origin) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Medium |
1415
| 882 | [细分图中的可到达结点](https://github.com/openset/leetcode/tree/master/problems/reachable-nodes-in-subdivided-graph) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] | Hard |

‎tag/linked-list/README.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -38,7 +38,7 @@
3838
| 83 | [删除排序链表中的重复元素](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-list) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Easy |
3939
| 82 | [删除排序链表中的重复元素 II](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-list-ii) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Medium |
4040
| 61 | [旋转链表](https://github.com/openset/leetcode/tree/master/problems/rotate-list) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium |
41-
| 25 | [k个一组翻转链表](https://github.com/openset/leetcode/tree/master/problems/reverse-nodes-in-k-group) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Hard |
41+
| 25 | [K 个一组翻转链表](https://github.com/openset/leetcode/tree/master/problems/reverse-nodes-in-k-group) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Hard |
4242
| 24 | [两两交换链表中的节点](https://github.com/openset/leetcode/tree/master/problems/swap-nodes-in-pairs) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Medium |
4343
| 23 | [合并K个排序链表](https://github.com/openset/leetcode/tree/master/problems/merge-k-sorted-lists) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Hard |
4444
| 21 | [合并两个有序链表](https://github.com/openset/leetcode/tree/master/problems/merge-two-sorted-lists) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Easy |

‎tag/sliding-window/README.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -9,6 +9,7 @@
99

1010
| # | 题名 | 标签 | 难度 |
1111
| :-: | - | - | :-: |
12+
| 1052 | [爱生气的书店老板](https://github.com/openset/leetcode/tree/master/problems/grumpy-bookstore-owner) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium |
1213
| 1040 | [移动石子直到连续 II](https://github.com/openset/leetcode/tree/master/problems/moving-stones-until-consecutive-ii) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium |
1314
| 1004 | [最大连续1的个数 III](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones-iii) | [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium |
1415
| 995 | [K 连续位的最小翻转次数](https://github.com/openset/leetcode/tree/master/problems/minimum-number-of-k-consecutive-bit-flips) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Hard |

‎tag/sort/README.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -9,6 +9,7 @@
99

1010
| # | 题名 | 标签 | 难度 |
1111
| :-: | - | - | :-: |
12+
| 1054 | [距离相等的条形码](https://github.com/openset/leetcode/tree/master/problems/distant-barcodes) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] | Medium |
1213
| 1030 | [距离顺序排列矩阵单元格](https://github.com/openset/leetcode/tree/master/problems/matrix-cells-in-distance-order) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] | Easy |
1314
| 976 | [三角形的最大周长](https://github.com/openset/leetcode/tree/master/problems/largest-perimeter-triangle) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy |
1415
| 973 | [最接近原点的 K 个点](https://github.com/openset/leetcode/tree/master/problems/k-closest-points-to-origin) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Medium |

‎tag/tags.json‎

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -109,16 +109,16 @@
109109
"Slug": "trie",
110110
"TranslatedName": "字典树"
111111
},
112-
{
113-
"Name": "Recursion",
114-
"Slug": "recursion",
115-
"TranslatedName": "递归"
116-
},
117112
{
118113
"Name": "Sliding Window",
119114
"Slug": "sliding-window",
120115
"TranslatedName": "Sliding Window"
121116
},
117+
{
118+
"Name": "Recursion",
119+
"Slug": "recursion",
120+
"TranslatedName": "递归"
121+
},
122122
{
123123
"Name": "Ordered Map",
124124
"Slug": "ordered-map",

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /