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

Browse files
yanglbmeactions-user
authored andcommitted
style: prettify code
1 parent 3f21255 commit 394059a

File tree

5 files changed

+10
-1
lines changed

5 files changed

+10
-1
lines changed

‎solution/0500-0599/0510.Inorder Successor in BST II/README_EN.md‎

Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -36,6 +36,7 @@ class Node {
3636
<strong>Input:</strong> tree = [2,1,3], node = 1
3737
<strong>Output:</strong> 2
3838
<strong>Explanation: </strong>1's in-order successor node is 2. Note that both the node and the return value is of Node type.
39+
3940
</pre>
4041

4142
<p><strong>Example 2:</strong></p>
@@ -46,6 +47,7 @@ class Node {
4647
<strong>Input:</strong> tree = [5,3,6,2,4,null,null,1], node = 6
4748
<strong>Output:</strong> null
4849
<strong>Explanation: </strong>There is no in-order successor of the current node, so the answer is null.
50+
4951
</pre>
5052

5153
<p><strong>Example 3:</strong></p>
@@ -55,6 +57,7 @@ class Node {
5557

5658
<strong>Input:</strong> tree = [15,6,18,3,7,17,20,2,4,null,13,null,null,null,null,null,null,null,null,9], node = 15
5759
<strong>Output:</strong> 17
60+
5861
</pre>
5962

6063
<p><strong>Example 4:</strong></p>
@@ -64,6 +67,7 @@ class Node {
6467

6568
<strong>Input:</strong> tree = [15,6,18,3,7,17,20,2,4,null,13,null,null,null,null,null,null,null,null,9], node = 13
6669
<strong>Output:</strong> 15
70+
6771
</pre>
6872

6973
<p><strong>Example 5:</strong></p>

‎solution/0700-0799/0708.Insert into a Sorted Circular Linked List/README_EN.md‎

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -14,7 +14,9 @@
1414
<p><strong>Example 1:</strong></p>
1515

1616
![](./images/example_1_before_65p.jpg)
17-
17+
18+
19+
1820
<pre>
1921
<strong>Input:</strong> head = [3,4,1], insertVal = 2
2022
<strong>Output:</strong> [3,4,1,2]

‎solution/1600-1699/1631.Path With Minimum Effort/README.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -27,6 +27,7 @@
2727
<p><strong>示例 2:</strong></p>
2828

2929
![](./images/ex2.png)
30+
3031
<pre>
3132
<b>输入:</b>heights = [[1,2,3],[3,8,4],[5,3,5]]
3233
<b>输出:</b>1

‎solution/1600-1699/1637.Widest Vertical Area Between Two Points Containing No Points/README.md‎

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

1818
![](./images/points3.png)
1919
20+
2021
<pre>
2122
<b>输入:</b>points = [[8,7],[9,9],[7,4],[9,7]]
2223
<b>输出:</b>1

‎solution/1600-1699/1637.Widest Vertical Area Between Two Points Containing No Points/README_EN.md‎

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

1616
![](./images/points3.png)
1717
18+
1819
<pre>
1920
<strong>Input:</strong> points = [[8,7],[9,9],[7,4],[9,7]]
2021
<strong>Output:</strong> 1

0 commit comments

Comments
(0)

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