style: prettify code

yanglbme · actions-user · commit 394059a142c5 · 2021-02-19T13:21:42.000Z
diff --git a/solution/0500-0599/0510.Inorder Successor in BST II/README_EN.md b/solution/0500-0599/0510.Inorder Successor in BST II/README_EN.md
@@ -36,6 +36,7 @@ class Node {
 <strong>Input:</strong> tree = [2,1,3], node = 1
 <strong>Output:</strong> 2
 <strong>Explanation: </strong>1's in-order successor node is 2. Note that both the node and the return value is of Node type.
+
 </pre>
 
 <p><strong>Example 2:</strong></p>
@@ -46,6 +47,7 @@ class Node {
 <strong>Input:</strong> tree = [5,3,6,2,4,null,null,1], node = 6
 <strong>Output:</strong> null
 <strong>Explanation: </strong>There is no in-order successor of the current node, so the answer is null.
+
 </pre>
 
 <p><strong>Example 3:</strong></p>
@@ -55,6 +57,7 @@ class Node {
 
 <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
 <strong>Output:</strong> 17
+
 </pre>
 
 <p><strong>Example 4:</strong></p>
@@ -64,6 +67,7 @@ class Node {
 
 <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
 <strong>Output:</strong> 15
+
 </pre>
 
 <p><strong>Example 5:</strong></p>
diff --git a/solution/0700-0799/0708.Insert into a Sorted Circular Linked List/README_EN.md b/solution/0700-0799/0708.Insert into a Sorted Circular Linked List/README_EN.md
@@ -14,7 +14,9 @@
 <p><strong>Example 1:</strong></p>
 
 ![](./images/example_1_before_65p.jpg)
- 
+
+
+
 <pre>
 <strong>Input:</strong> head = [3,4,1], insertVal = 2
 <strong>Output:</strong> [3,4,1,2]
diff --git a/solution/1600-1699/1631.Path With Minimum Effort/README.md b/solution/1600-1699/1631.Path With Minimum Effort/README.md
@@ -27,6 +27,7 @@
 <p><strong>示例 2：</strong></p>
 
 ![](./images/ex2.png)
+
 <pre>
 <b>输入：</b>heights = [[1,2,3],[3,8,4],[5,3,5]]
 <b>输出：</b>1
diff --git a/solution/1600-1699/1637.Widest Vertical Area Between Two Points Containing No Points/README.md b/solution/1600-1699/1637.Widest Vertical Area Between Two Points Containing No Points/README.md
@@ -17,6 +17,7 @@
 
 ![](./images/points3.png)
 ​
+
 <pre>
 <b>输入：</b>points = [[8,7],[9,9],[7,4],[9,7]]
 <b>输出：</b>1
diff --git a/solution/1600-1699/1637.Widest Vertical Area Between Two Points Containing No Points/README_EN.md b/solution/1600-1699/1637.Widest Vertical Area Between Two Points Containing No Points/README_EN.md
@@ -15,6 +15,7 @@
 
 ![](./images/points3.png)
 ​
+
 <pre>
 <strong>Input:</strong> points = [[8,7],[9,9],[7,4],[9,7]]
 <strong>Output:</strong> 1
