U: tidy

Author: Shuo

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>

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>
 

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>

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>
 

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)]

problems/quad-tree-intersection/README.md

@@ -27,12 +27,13 @@ XRLXXRRXL ->
 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)]