Skip to content

Commit f7ea9e8

Browse files
author
Shuo
committed
U: tidy
1 parent 9baaaf5 commit f7ea9e8

File tree

18 files changed

+16
-166
lines changed

18 files changed

+16
-166
lines changed

‎problems/angle-between-hands-of-a-clock/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -11,7 +11,7 @@
1111

1212
## [1344. Angle Between Hands of a Clock (Medium)](https://leetcode.com/problems/angle-between-hands-of-a-clock "时钟指针的夹角")
1313

14-
<p>Given two numbers, <code>hour</code> and <code>minutes</code>. Return the smaller angle (in sexagesimal units) formed between the <code>hour</code> and the <code>minute</code> hand.</p>
14+
<p>Given two numbers, <code>hour</code> and <code>minutes</code>. Return the smaller angle (in degrees) formed between the <code>hour</code> and the <code>minute</code> hand.</p>
1515

1616
<p>&nbsp;</p>
1717
<p><strong>Example 1:</strong></p>

‎problems/binary-tree-level-order-traversal/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,7 @@
99

1010
[Next >](../binary-tree-zigzag-level-order-traversal "Binary Tree Zigzag Level Order Traversal")
1111

12-
## [102. Binary Tree Level Order Traversal (Medium)](https://leetcode.com/problems/binary-tree-level-order-traversal "二叉树的层次遍历")
12+
## [102. Binary Tree Level Order Traversal (Medium)](https://leetcode.com/problems/binary-tree-level-order-traversal "二叉树的层序遍历")
1313

1414
<p>Given a binary tree, return the <i>level order</i> traversal of its nodes' values. (ie, from left to right, level by level).</p>
1515

‎problems/find-all-good-strings/README.md

+1
Original file line numberDiff line numberDiff line change
@@ -45,6 +45,7 @@ Next >
4545
<ul>
4646
<li><code>s1.length == n</code></li>
4747
<li><code>s2.length == n</code></li>
48+
<li><code>s1 &lt;= s2</code></li>
4849
<li><code>1 &lt;= n &lt;= 500</code></li>
4950
<li><code>1 &lt;= evil.length &lt;= 50</code></li>
5051
<li>All strings consist of lowercase English letters.</li>

‎problems/h-index/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,7 @@
99

1010
[Next >](../h-index-ii "H-Index II")
1111

12-
## [274. H-Index (Medium)](https://leetcode.com/problems/h-index "H指数")
12+
## [274. H-Index (Medium)](https://leetcode.com/problems/h-index "H 指数")
1313

1414
<p>Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher&#39;s h-index.</p>
1515

‎problems/integer-replacement/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -57,5 +57,5 @@ or
5757
</p>
5858

5959
### Related Topics
60-
[[Bit Manipulation](../../tag/bit-manipulation/README.md)]
6160
[[Math](../../tag/math/README.md)]
61+
[[Bit Manipulation](../../tag/bit-manipulation/README.md)]

‎problems/quad-tree-intersection/README.md

-80
This file was deleted.

‎problems/quad-tree-intersection/quad_tree_intersection.go

-1
This file was deleted.

‎problems/quad-tree-intersection/quad_tree_intersection.py

-16
This file was deleted.

‎problems/quad-tree-intersection/quad_tree_intersection_test.go

-1
This file was deleted.

‎problems/swap-adjacent-in-lr-string/README.md

+5-4
Original file line numberDiff line numberDiff line change
@@ -27,12 +27,13 @@ XRLXXRRXL -&gt;
2727
XRLXXRRLX
2828
</pre>
2929

30-
<p><strong>Note:</strong></p>
30+
<p>&nbsp;</p>
31+
<p><strong>Constraints:</strong></p>
3132

32-
<ol>
33-
<li><code>1 &lt;= len(start) = len(end) &lt;= 10000</code>.</li>
33+
<ul>
34+
<li><code>1 &lt;= len(start) == len(end) &lt;= 10000</code>.</li>
3435
<li>Both start and end will only consist of characters in <code>{&#39;L&#39;, &#39;R&#39;, &#39;X&#39;}</code>.</li>
35-
</ol>
36+
</ul>
3637

3738
### Related Topics
3839
[[Brainteaser](../../tag/brainteaser/README.md)]

‎problems/unique-letter-string/README.md

-52
This file was deleted.

‎problems/unique-letter-string/unique_letter_string.go

-1
This file was deleted.

‎problems/unique-letter-string/unique_letter_string_test.go

-1
This file was deleted.

‎readme/1-300.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -163,7 +163,7 @@ LeetCode Problems' Solutions
163163
| <span id="99">99</span> | [Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree "恢复二叉搜索树") | [Go](../problems/recover-binary-search-tree) | Hard |
164164
| <span id="100">100</span> | [Same Tree](https://leetcode.com/problems/same-tree "相同的树") | [Go](../problems/same-tree) | Easy |
165165
| <span id="101">101</span> | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree "对称二叉树") | [Go](../problems/symmetric-tree) | Easy |
166-
| <span id="102">102</span> | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal "二叉树的层次遍历") | [Go](../problems/binary-tree-level-order-traversal) | Medium |
166+
| <span id="102">102</span> | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal "二叉树的层序遍历") | [Go](../problems/binary-tree-level-order-traversal) | Medium |
167167
| <span id="103">103</span> | [Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal "二叉树的锯齿形层次遍历") | [Go](../problems/binary-tree-zigzag-level-order-traversal) | Medium |
168168
| <span id="104">104</span> | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree "二叉树的最大深度") | [Go](../problems/maximum-depth-of-binary-tree) | Easy |
169169
| <span id="105">105</span> | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal "从前序与中序遍历序列构造二叉树") | [Go](../problems/construct-binary-tree-from-preorder-and-inorder-traversal) | Medium |
@@ -335,7 +335,7 @@ LeetCode Problems' Solutions
335335
| <span id="271">271</span> | [Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings "字符串的编码与解码") 🔒 | [Go](../problems/encode-and-decode-strings) | Medium |
336336
| <span id="272">272</span> | [Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii "最接近的二叉搜索树值 II") 🔒 | [Go](../problems/closest-binary-search-tree-value-ii) | Hard |
337337
| <span id="273">273</span> | [Integer to English Words](https://leetcode.com/problems/integer-to-english-words "整数转换英文表示") | [Go](../problems/integer-to-english-words) | Hard |
338-
| <span id="274">274</span> | [H-Index](https://leetcode.com/problems/h-index "H指数") | [Go](../problems/h-index) | Medium |
338+
| <span id="274">274</span> | [H-Index](https://leetcode.com/problems/h-index "H 指数") | [Go](../problems/h-index) | Medium |
339339
| <span id="275">275</span> | [H-Index II](https://leetcode.com/problems/h-index-ii "H指数 II") | [Go](../problems/h-index-ii) | Medium |
340340
| <span id="276">276</span> | [Paint Fence](https://leetcode.com/problems/paint-fence "栅栏涂色") 🔒 | [Go](../problems/paint-fence) | Easy |
341341
| <span id="277">277</span> | [Find the Celebrity](https://leetcode.com/problems/find-the-celebrity "搜寻名人") 🔒 | [Go](../problems/find-the-celebrity) | Medium |

‎tag/breadth-first-search/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -74,5 +74,5 @@
7474
| 111 | [二叉树的最小深度](../../problems/minimum-depth-of-binary-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Easy |
7575
| 107 | [二叉树的层次遍历 II](../../problems/binary-tree-level-order-traversal-ii) | [[树](../tree/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Easy |
7676
| 103 | [二叉树的锯齿形层次遍历](../../problems/binary-tree-zigzag-level-order-traversal) | [[栈](../stack/README.md)] [[树](../tree/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium |
77-
| 102 | [二叉树的层次遍历](../../problems/binary-tree-level-order-traversal) | [[树](../tree/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium |
77+
| 102 | [二叉树的层序遍历](../../problems/binary-tree-level-order-traversal) | [[树](../tree/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium |
7878
| 101 | [对称二叉树](../../problems/symmetric-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Easy |

‎tag/hash-table/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -104,7 +104,7 @@
104104
| 299 | [猜数字游戏](../../problems/bulls-and-cows) | [[哈希表](../hash-table/README.md)] | Easy |
105105
| 290 | [单词规律](../../problems/word-pattern) | [[哈希表](../hash-table/README.md)] | Easy |
106106
| 288 | [单词的唯一缩写](../../problems/unique-word-abbreviation) 🔒 | [[设计](../design/README.md)] [[哈希表](../hash-table/README.md)] | Medium |
107-
| 274 | [H指数](../../problems/h-index) | [[排序](../sort/README.md)] [[哈希表](../hash-table/README.md)] | Medium |
107+
| 274 | [H 指数](../../problems/h-index) | [[排序](../sort/README.md)] [[哈希表](../hash-table/README.md)] | Medium |
108108
| 266 | [回文排列](../../problems/palindrome-permutation) 🔒 | [[哈希表](../hash-table/README.md)] | Easy |
109109
| 249 | [移位字符串分组](../../problems/group-shifted-strings) 🔒 | [[哈希表](../hash-table/README.md)] [[字符串](../string/README.md)] | Medium |
110110
| 246 | [中心对称数](../../problems/strobogrammatic-number) 🔒 | [[哈希表](../hash-table/README.md)] [[数学](../math/README.md)] | Easy |

‎tag/sort/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -44,7 +44,7 @@
4444
| 315 | [计算右侧小于当前元素的个数](../../problems/count-of-smaller-numbers-after-self) | [[排序](../sort/README.md)] [[树状数组](../binary-indexed-tree/README.md)] [[线段树](../segment-tree/README.md)] [[二分查找](../binary-search/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Hard |
4545
| 296 | [最佳的碰头地点](../../problems/best-meeting-point) 🔒 | [[排序](../sort/README.md)] [[数学](../math/README.md)] | Hard |
4646
| 280 | [摆动排序](../../problems/wiggle-sort) 🔒 | [[排序](../sort/README.md)] [[数组](../array/README.md)] | Medium |
47-
| 274 | [H指数](../../problems/h-index) | [[排序](../sort/README.md)] [[哈希表](../hash-table/README.md)] | Medium |
47+
| 274 | [H 指数](../../problems/h-index) | [[排序](../sort/README.md)] [[哈希表](../hash-table/README.md)] | Medium |
4848
| 253 | [会议室 II](../../problems/meeting-rooms-ii) 🔒 | [[堆](../heap/README.md)] [[贪心算法](../greedy/README.md)] [[排序](../sort/README.md)] | Medium |
4949
| 252 | [会议室](../../problems/meeting-rooms) 🔒 | [[排序](../sort/README.md)] | Easy |
5050
| 242 | [有效的字母异位词](../../problems/valid-anagram) | [[排序](../sort/README.md)] [[哈希表](../hash-table/README.md)] | Easy |

‎tag/tree/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -132,7 +132,7 @@
132132
| 105 | [从前序与中序遍历序列构造二叉树](../../problems/construct-binary-tree-from-preorder-and-inorder-traversal) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[数组](../array/README.md)] | Medium |
133133
| 104 | [二叉树的最大深度](../../problems/maximum-depth-of-binary-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Easy |
134134
| 103 | [二叉树的锯齿形层次遍历](../../problems/binary-tree-zigzag-level-order-traversal) | [[栈](../stack/README.md)] [[树](../tree/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium |
135-
| 102 | [二叉树的层次遍历](../../problems/binary-tree-level-order-traversal) | [[树](../tree/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium |
135+
| 102 | [二叉树的层序遍历](../../problems/binary-tree-level-order-traversal) | [[树](../tree/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium |
136136
| 101 | [对称二叉树](../../problems/symmetric-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Easy |
137137
| 100 | [相同的树](../../problems/same-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Easy |
138138
| 99 | [恢复二叉搜索树](../../problems/recover-binary-search-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Hard |

0 commit comments

Comments
 (0)