awesee · awesee · Apr 2, 2020 · Apr 2, 2020
diff --git a/problems/angle-between-hands-of-a-clock/README.md b/problems/angle-between-hands-of-a-clock/README.md
@@ -11,7 +11,7 @@
 
 ## [1344. Angle Between Hands of a Clock (Medium)](https://leetcode.com/problems/angle-between-hands-of-a-clock "时钟指针的夹角")
 
-<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>
+<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>
 
 <p>&nbsp;</p>
 <p><strong>Example 1:</strong></p>

diff --git a/problems/binary-tree-level-order-traversal/README.md b/problems/binary-tree-level-order-traversal/README.md
@@ -9,7 +9,7 @@
 
 [Next >](../binary-tree-zigzag-level-order-traversal "Binary Tree Zigzag Level Order Traversal")
 
-## [102. Binary Tree Level Order Traversal (Medium)](https://leetcode.com/problems/binary-tree-level-order-traversal "二叉树的层次遍历")
+## [102. Binary Tree Level Order Traversal (Medium)](https://leetcode.com/problems/binary-tree-level-order-traversal "二叉树的层序遍历")
 
 <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>
 

diff --git a/problems/find-all-good-strings/README.md b/problems/find-all-good-strings/README.md
@@ -45,6 +45,7 @@ Next >
 <ul>
 	<li><code>s1.length == n</code></li>
 	<li><code>s2.length == n</code></li>
+	<li><code>s1 &lt;= s2</code></li>
 	<li><code>1 &lt;= n &lt;= 500</code></li>
 	<li><code>1 &lt;= evil.length &lt;= 50</code></li>
 	<li>All strings consist of lowercase English letters.</li>

diff --git a/problems/h-index/README.md b/problems/h-index/README.md
@@ -9,7 +9,7 @@
 
 [Next >](../h-index-ii "H-Index II")
 
-## [274. H-Index (Medium)](https://leetcode.com/problems/h-index "H指数")
+## [274. H-Index (Medium)](https://leetcode.com/problems/h-index "H 指数")
 
 <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>
 

diff --git a/problems/integer-replacement/README.md b/problems/integer-replacement/README.md
@@ -57,5 +57,5 @@ or
 </p>
 
 ### Related Topics
-  [[Bit Manipulation](../../tag/bit-manipulation/README.md)]
   [[Math](../../tag/math/README.md)]
+  [[Bit Manipulation](../../tag/bit-manipulation/README.md)]
diff --git a/problems/quad-tree-intersection/README.md b/problems/quad-tree-intersection/README.md
diff --git a/problems/quad-tree-intersection/quad_tree_intersection.go b/problems/quad-tree-intersection/quad_tree_intersection.go
diff --git a/problems/quad-tree-intersection/quad_tree_intersection.py b/problems/quad-tree-intersection/quad_tree_intersection.py
diff --git a/problems/quad-tree-intersection/quad_tree_intersection_test.go b/problems/quad-tree-intersection/quad_tree_intersection_test.go
diff --git a/problems/swap-adjacent-in-lr-string/README.md b/problems/swap-adjacent-in-lr-string/README.md
@@ -27,12 +27,13 @@ XRLXXRRXL -&gt;
 XRLXXRRLX
 </pre>
 
-<p><strong>Note:</strong></p>
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
 
-<ol>
-	<li><code>1 &lt;= len(start) = len(end) &lt;= 10000</code>.</li>
+<ul>
+	<li><code>1 &lt;= len(start) == len(end) &lt;= 10000</code>.</li>
 	<li>Both start and end will only consist of characters in <code>{&#39;L&#39;, &#39;R&#39;, &#39;X&#39;}</code>.</li>
-</ol>
+</ul>
 
 ### Related Topics
   [[Brainteaser](../../tag/brainteaser/README.md)]

diff --git a/problems/unique-letter-string/README.md b/problems/unique-letter-string/README.md
diff --git a/problems/unique-letter-string/unique_letter_string.go b/problems/unique-letter-string/unique_letter_string.go
diff --git a/problems/unique-letter-string/unique_letter_string_test.go b/problems/unique-letter-string/unique_letter_string_test.go
diff --git a/readme/1-300.md b/readme/1-300.md
@@ -163,7 +163,7 @@ LeetCode Problems' Solutions
 | <span id="99">99</span> | [Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree "恢复二叉搜索树") | [Go](../problems/recover-binary-search-tree) | Hard |
 | <span id="100">100</span> | [Same Tree](https://leetcode.com/problems/same-tree "相同的树") | [Go](../problems/same-tree) | Easy |
 | <span id="101">101</span> | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree "对称二叉树") | [Go](../problems/symmetric-tree) | Easy |
-| <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 |
+| <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 |
 | <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 |
 | <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 |
 | <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
 | <span id="271">271</span> | [Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings "字符串的编码与解码") 🔒 | [Go](../problems/encode-and-decode-strings) | Medium |
 | <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 |
 | <span id="273">273</span> | [Integer to English Words](https://leetcode.com/problems/integer-to-english-words "整数转换英文表示") | [Go](../problems/integer-to-english-words) | Hard |
-| <span id="274">274</span> | [H-Index](https://leetcode.com/problems/h-index "H指数") | [Go](../problems/h-index) | Medium |
+| <span id="274">274</span> | [H-Index](https://leetcode.com/problems/h-index "H 指数") | [Go](../problems/h-index) | Medium |
 | <span id="275">275</span> | [H-Index II](https://leetcode.com/problems/h-index-ii "H指数 II") | [Go](../problems/h-index-ii) | Medium |
 | <span id="276">276</span> | [Paint Fence](https://leetcode.com/problems/paint-fence "栅栏涂色") 🔒 | [Go](../problems/paint-fence) | Easy |
 | <span id="277">277</span> | [Find the Celebrity](https://leetcode.com/problems/find-the-celebrity "搜寻名人") 🔒 | [Go](../problems/find-the-celebrity) | Medium |

diff --git a/tag/breadth-first-search/README.md b/tag/breadth-first-search/README.md
@@ -74,5 +74,5 @@
 | 111 | [二叉树的最小深度](../../problems/minimum-depth-of-binary-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)]  | Easy |
 | 107 | [二叉树的层次遍历 II](../../problems/binary-tree-level-order-traversal-ii) | [[树](../tree/README.md)] [[广度优先搜索](../breadth-first-search/README.md)]  | Easy |
 | 103 | [二叉树的锯齿形层次遍历](../../problems/binary-tree-zigzag-level-order-traversal) | [[栈](../stack/README.md)] [[树](../tree/README.md)] [[广度优先搜索](../breadth-first-search/README.md)]  | Medium |
-| 102 | [二叉树的层次遍历](../../problems/binary-tree-level-order-traversal) | [[树](../tree/README.md)] [[广度优先搜索](../breadth-first-search/README.md)]  | Medium |
+| 102 | [二叉树的层序遍历](../../problems/binary-tree-level-order-traversal) | [[树](../tree/README.md)] [[广度优先搜索](../breadth-first-search/README.md)]  | Medium |
 | 101 | [对称二叉树](../../problems/symmetric-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)]  | Easy |
diff --git a/tag/hash-table/README.md b/tag/hash-table/README.md
@@ -104,7 +104,7 @@
 | 299 | [猜数字游戏](../../problems/bulls-and-cows) | [[哈希表](../hash-table/README.md)]  | Easy |
 | 290 | [单词规律](../../problems/word-pattern) | [[哈希表](../hash-table/README.md)]  | Easy |
 | 288 | [单词的唯一缩写](../../problems/unique-word-abbreviation) 🔒 | [[设计](../design/README.md)] [[哈希表](../hash-table/README.md)]  | Medium |
-| 274 | [H指数](../../problems/h-index) | [[排序](../sort/README.md)] [[哈希表](../hash-table/README.md)]  | Medium |
+| 274 | [H 指数](../../problems/h-index) | [[排序](../sort/README.md)] [[哈希表](../hash-table/README.md)]  | Medium |
 | 266 | [回文排列](../../problems/palindrome-permutation) 🔒 | [[哈希表](../hash-table/README.md)]  | Easy |
 | 249 | [移位字符串分组](../../problems/group-shifted-strings) 🔒 | [[哈希表](../hash-table/README.md)] [[字符串](../string/README.md)]  | Medium |
 | 246 | [中心对称数](../../problems/strobogrammatic-number) 🔒 | [[哈希表](../hash-table/README.md)] [[数学](../math/README.md)]  | Easy |

diff --git a/tag/sort/README.md b/tag/sort/README.md
@@ -44,7 +44,7 @@
 | 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 |
 | 296 | [最佳的碰头地点](../../problems/best-meeting-point) 🔒 | [[排序](../sort/README.md)] [[数学](../math/README.md)]  | Hard |
 | 280 | [摆动排序](../../problems/wiggle-sort) 🔒 | [[排序](../sort/README.md)] [[数组](../array/README.md)]  | Medium |
-| 274 | [H指数](../../problems/h-index) | [[排序](../sort/README.md)] [[哈希表](../hash-table/README.md)]  | Medium |
+| 274 | [H 指数](../../problems/h-index) | [[排序](../sort/README.md)] [[哈希表](../hash-table/README.md)]  | Medium |
 | 253 | [会议室 II](../../problems/meeting-rooms-ii) 🔒 | [[堆](../heap/README.md)] [[贪心算法](../greedy/README.md)] [[排序](../sort/README.md)]  | Medium |
 | 252 | [会议室](../../problems/meeting-rooms) 🔒 | [[排序](../sort/README.md)]  | Easy |
 | 242 | [有效的字母异位词](../../problems/valid-anagram) | [[排序](../sort/README.md)] [[哈希表](../hash-table/README.md)]  | Easy |

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