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

Lines changed: 1 addition & 1 deletion
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

Lines changed: 1 addition & 1 deletion
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

Lines changed: 1 addition & 0 deletions
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

Lines changed: 1 addition & 1 deletion
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

Lines changed: 1 addition & 1 deletion
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

Lines changed: 0 additions & 80 deletions
This file was deleted.

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

Lines changed: 0 additions & 1 deletion
This file was deleted.

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

Lines changed: 0 additions & 16 deletions
This file was deleted.

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

Lines changed: 0 additions & 1 deletion
This file was deleted.

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

Lines changed: 5 additions & 4 deletions
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)]

0 commit comments

Comments
(0)

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