feat: change images path

Author: yanglbme

solution/1400-1499/1463.Cherry Pickup II/README.md

@@ -23,7 +23,7 @@
 
 <p><strong>示例 1：</strong></p>
 
-<p><strong><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/05/30/sample_1_1802.png" style="height: 182px; width: 139px;"></strong></p>
+![](./images/sample_1_1802.png)
 
 <pre><strong>输入：</strong>grid = [[3,1,1],[2,5,1],[1,5,5],[2,1,1]]
 <strong>输出：</strong>24
@@ -35,7 +35,7 @@
 
 <p><strong>示例 2：</strong></p>
 
-<p><strong><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/05/30/sample_2_1802.png" style="height: 257px; width: 284px;"></strong></p>
+![](./images/sample_2_1802.png)
 
 <pre><strong>输入：</strong>grid = [[1,0,0,0,0,0,1],[2,0,0,0,0,3,0],[2,0,9,0,0,0,0],[0,3,0,5,4,0,0],[1,0,2,3,0,0,6]]
 <strong>输出：</strong>28

solution/1400-1499/1463.Cherry Pickup II/README_EN.md

@@ -21,7 +21,8 @@
 <p>&nbsp;</p>
 <p><strong>Example 1:</strong></p>
 
-<p><strong><img alt="" src="https://assets.leetcode.com/uploads/2020/04/29/sample_1_1802.png" style="width: 139px; height: 182px;" /></strong></p>
+![](./images/sample_1_1802.png)
+
 
 <pre>
 <strong>Input:</strong> grid = [[3,1,1],[2,5,1],[1,5,5],[2,1,1]]
@@ -34,7 +35,7 @@ Total of cherries: 12 + 12 = 24.
 
 <p><strong>Example 2:</strong></p>
 
-<p><strong><img alt="" src="https://assets.leetcode.com/uploads/2020/04/23/sample_2_1802.png" style="width: 284px; height: 257px;" /></strong></p>
+![](./images/sample_2_1802.png)
 
 <pre>
 <strong>Input:</strong> grid = [[1,0,0,0,0,0,1],[2,0,0,0,0,3,0],[2,0,9,0,0,0,0],[0,3,0,5,4,0,0],[1,0,2,3,0,0,6]]

solution/1400-1499/1463.Cherry Pickup II/images/sample_1_1802.png

@@ -13,7 +13,7 @@
 
 <p><strong>示例 1：</strong></p>
 
-<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/05/30/leetcode_max_area_2.png" style="height: 320px; width: 300px;"></p>
+![](./images/leetcode_max_area_2.png)
 
 <pre><strong>输入：</strong>h = 5, w = 4, horizontalCuts = [1,2,4], verticalCuts = [1,3]
 <strong>输出：</strong>4 
@@ -22,7 +22,7 @@
 
 <p><strong>示例 2：</strong></p>
 
-<p><strong><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/05/30/leetcode_max_area_3.png" style="height: 320px; width: 300px;"></strong></p>
+![](./images/leetcode_max_area_3.png)
 
 <pre><strong>输入：</strong>h = 5, w = 4, horizontalCuts = [3,1], verticalCuts = [1]
 <strong>输出：</strong>6

solution/1400-1499/1463.Cherry Pickup II/images/sample_2_1802.png

@@ -11,7 +11,7 @@
 <p>&nbsp;</p>
 <p><strong>Example 1:</strong></p>
 
-<p><img alt="" src="https://assets.leetcode.com/uploads/2020/05/14/leetcode_max_area_2.png" style="width: 300px; height: 320px;" /></p>
+![](./images/leetcode_max_area_2.png)
 
 <pre>
 <strong>Input:</strong> h = 5, w = 4, horizontalCuts = [1,2,4], verticalCuts = [1,3]
@@ -21,7 +21,7 @@
 
 <p><strong>Example 2:</strong></p>
 
-<p><strong><img alt="" src="https://assets.leetcode.com/uploads/2020/05/14/leetcode_max_area_3.png" style="width: 300px; height: 320px;" /></strong></p>
+![](./images/leetcode_max_area_3.png)
 
 <pre>
 <strong>Input:</strong> h = 5, w = 4, horizontalCuts = [3,1], verticalCuts = [1]

solution/1400-1499/1465.Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts/README.md

@@ -19,15 +19,17 @@
 
 <p><strong>示例 1：</strong></p>
 
-<p><strong><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/05/30/sample_1_1819.png" style="height: 150px; width: 240px;"></strong></p>
+
+![](./images/sample_1_1819.png)
 
 <pre><strong>输入：</strong>n = 6, connections = [[0,1],[1,3],[2,3],[4,0],[4,5]]
 <strong>输出：</strong>3
 <strong>解释：</strong>更改以红色显示的路线的方向，使每个城市都可以到达城市 0 。</pre>
 
 <p><strong>示例 2：</strong></p>
 
-<p><strong><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/05/30/sample_2_1819.png" style="height: 60px; width: 380px;"></strong></p>
+
+![](./images/sample_2_1819.png)
 
 <pre><strong>输入：</strong>n = 5, connections = [[1,0],[1,2],[3,2],[3,4]]
 <strong>输出：</strong>2

solution/1400-1499/1465.Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts/README_EN.md

@@ -17,7 +17,7 @@
 <p>&nbsp;</p>
 <p><strong>Example 1:</strong></p>
 
-<p><strong><img alt="" src="https://assets.leetcode.com/uploads/2020/05/13/sample_1_1819.png" style="width: 240px; height: 150px;" /></strong></p>
+![](./images/sample_1_1819.png)
 
 <pre>
 <strong>Input:</strong> n = 6, connections = [[0,1],[1,3],[2,3],[4,0],[4,5]]
@@ -26,7 +26,7 @@
 
 <p><strong>Example 2:</strong></p>
 
-<p><strong><img alt="" src="https://assets.leetcode.com/uploads/2020/05/13/sample_2_1819.png" style="width: 380px; height: 60px;" /></strong></p>
+![](./images/sample_2_1819.png)
 
 <pre>
 <strong>Input:</strong> n = 5, connections = [[1,0],[1,2],[3,2],[3,4]]

solution/1400-1499/1465.Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts/images/leetcode_max_area_2.png

@@ -15,7 +15,7 @@
 
 <p><strong>示例 1：</strong></p>
 
-<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/06/13/sample_11_1816.png" style="height: 154px; width: 454px;"></p>
+![](./images/sample_11_1816.png)
 
 <pre><strong>输入：</strong>houses = [1,4,8,10,20], k = 3
 <strong>输出：</strong>5
@@ -25,7 +25,7 @@
 
 <p><strong>示例 2：</strong></p>
 
-<p><strong><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/06/13/sample_2_1816.png" style="height: 154px; width: 433px;"></strong></p>
+![](./images/sample_2_1816.png)
 
 <pre><strong>输入：</strong>houses = [2,3,5,12,18], k = 2
 <strong>输出：</strong>9

solution/1400-1499/1465.Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts/images/leetcode_max_area_3.png

@@ -1,86 +1,129 @@
-# [1478. Allocate Mailboxes](https://leetcode.com/problems/allocate-mailboxes)
-
-[中文文档](/solution/1400-1499/1478.Allocate%20Mailboxes/README.md)
-
-## Description
-
-<p>Given the array <code>houses</code> and an integer <code>k</code>. where <code>houses[i]</code> is the location of the ith house along a street, your task is to allocate <code>k</code> mailboxes in&nbsp;the street.</p>
-
-<p>Return the <strong>minimum</strong> total distance between each house and its nearest mailbox.</p>
-
-<p>The answer is guaranteed to fit in a 32-bit signed integer.</p>
-
-<p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
-
-<p><img alt="" src="https://assets.leetcode.com/uploads/2020/05/07/sample_11_1816.png" style="width: 454px; height: 154px;" /></p>
-
-<pre>
-<strong>Input:</strong> houses = [1,4,8,10,20], k = 3
-<strong>Output:</strong> 5
-<strong>Explanation: </strong>Allocate mailboxes in position 3, 9 and 20.
-Minimum total distance from each houses to nearest mailboxes is |3-1| + |4-3| + |9-8| + |10-9| + |20-20| = 5 
-</pre>
-
-<p><strong>Example 2:</strong></p>
-
-<p><strong><img alt="" src="https://assets.leetcode.com/uploads/2020/05/07/sample_2_1816.png" style="width: 433px; height: 154px;" /></strong></p>
-
-<pre>
-<strong>Input:</strong> houses = [2,3,5,12,18], k = 2
-<strong>Output:</strong> 9
-<strong>Explanation: </strong>Allocate mailboxes in position 3 and 14.
-Minimum total distance from each houses to nearest mailboxes is |2-3| + |3-3| + |5-3| + |12-14| + |18-14| = 9.
-</pre>
-
-<p><strong>Example 3:</strong></p>
-
-<pre>
-<strong>Input:</strong> houses = [7,4,6,1], k = 1
-<strong>Output:</strong> 8
-</pre>
-
-<p><strong>Example 4:</strong></p>
-
-<pre>
-<strong>Input:</strong> houses = [3,6,14,10], k = 4
-<strong>Output:</strong> 0
-</pre>
-
-<p>&nbsp;</p>
-<p><strong>Constraints:</strong></p>
-
-<ul>
-	<li><code>n == houses.length</code></li>
-	<li><code>1 &lt;= n&nbsp;&lt;= 100</code></li>
-	<li><code>1 &lt;= houses[i] &lt;= 10^4</code></li>
-	<li><code>1 &lt;= k &lt;= n</code></li>
-	<li>Array <code>houses</code> contain unique integers.</li>
-</ul>
-
-## Solutions
-
-
-
-<!-- tabs:start -->
-
-### **Python3**
-
-
-```python
-
-```
-
-### **Java**
-
-
-```java
-
-```
-
-### **...**
-```
-
-```
-
+# [1478. Allocate Mailboxes](https://leetcode.com/problems/allocate-mailboxes)
+
+[中文文档](/solution/1400-1499/1478.Allocate%20Mailboxes/README.md)
+
+## Description
+
+<p>Given the array <code>houses</code> and an integer <code>k</code>. where <code>houses[i]</code> is the location of the ith house along a street, your task is to allocate <code>k</code> mailboxes in&nbsp;the street.</p>
+
+
+
+<p>Return the <strong>minimum</strong> total distance between each house and its nearest mailbox.</p>
+
+
+
+<p>The answer is guaranteed to fit in a 32-bit signed integer.</p>
+
+
+
+<p>&nbsp;</p>
+
+<p><strong>Example 1:</strong></p>
+
+
+
+![](./images/sample_11_1816.png)
+
+<pre>
+
+<strong>Input:</strong> houses = [1,4,8,10,20], k = 3
+
+<strong>Output:</strong> 5
+
+<strong>Explanation: </strong>Allocate mailboxes in position 3, 9 and 20.
+
+Minimum total distance from each houses to nearest mailboxes is |3-1| + |4-3| + |9-8| + |10-9| + |20-20| = 5 
+
+</pre>
+
+
+
+<p><strong>Example 2:</strong></p>
+
+
+
+![](./images/sample_2_1816.png)
+
+
+<pre>
+
+<strong>Input:</strong> houses = [2,3,5,12,18], k = 2
+
+<strong>Output:</strong> 9
+
+<strong>Explanation: </strong>Allocate mailboxes in position 3 and 14.
+
+Minimum total distance from each houses to nearest mailboxes is |2-3| + |3-3| + |5-3| + |12-14| + |18-14| = 9.
+
+</pre>
+
+
+
+<p><strong>Example 3:</strong></p>
+
+
+
+<pre>
+
+<strong>Input:</strong> houses = [7,4,6,1], k = 1
+
+<strong>Output:</strong> 8
+
+</pre>
+
+
+
+<p><strong>Example 4:</strong></p>
+
+
+
+<pre>
+
+<strong>Input:</strong> houses = [3,6,14,10], k = 4
+
+<strong>Output:</strong> 0
+
+</pre>
+
+
+
+<p>&nbsp;</p>
+
+<p><strong>Constraints:</strong></p>
+
+
+
+<ul>
+	<li><code>n == houses.length</code></li>
+	<li><code>1 &lt;= n&nbsp;&lt;= 100</code></li>
+	<li><code>1 &lt;= houses[i] &lt;= 10^4</code></li>
+	<li><code>1 &lt;= k &lt;= n</code></li>
+	<li>Array <code>houses</code> contain unique integers.</li>
+</ul>
+
+## Solutions
+
+
+
+<!-- tabs:start -->
+
+### **Python3**
+
+
+```python
+
+```
+
+### **Java**
+
+
+```java
+
+```
+
+### **...**
+```
+
+```
+
 <!-- tabs:end -->

solution/1400-1499/1466.Reorder Routes to Make All Paths Lead to the City Zero/README.md

@@ -15,7 +15,8 @@
 
 <p><strong>示例：</strong></p>
 
-<p><strong><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/06/14/1528_ex1.png" style="height: 262px; width: 396px;"></strong></p>
+
+![](./images/1528_ex1.png)
 
 <pre><strong>输入：</strong>
 [&quot;TreeAncestor&quot;,&quot;getKthAncestor&quot;,&quot;getKthAncestor&quot;,&quot;getKthAncestor&quot;]