fix: update images path

Author: yanglbme

solution/0700-0799/0787.Cheapest Flights Within K Stops/README.md

@@ -18,10 +18,11 @@ src = 0, dst = 2, k = 1
 <strong>输出:</strong> 200
 <strong>解释:</strong> 
 城市航班图如下
-<img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/02/16/995.png" style="height: 180px; width: 246px;">
 
 从城市 0 到城市 2 在 1 站中转以内的最便宜价格是 200，如图中红色所示。</pre>
 
+![](./images/995.png)
+
 <p><strong>示例 2：</strong></p>
 
 <pre><strong>输入:</strong> 
@@ -30,10 +31,11 @@ src = 0, dst = 2, k = 0
 <strong>输出:</strong> 500
 <strong>解释:</strong> 
 城市航班图如下
-<img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/02/16/995.png" style="height: 180px; width: 246px;">
 
 从城市 0 到城市 2 在 0 站中转以内的最便宜价格是 500，如图中蓝色所示。</pre>
 
+![](./images/995.png)
+
 <p>&nbsp;</p>
 
 <p><strong>提示：</strong></p>

solution/0700-0799/0787.Cheapest Flights Within K Stops/README_EN.md

@@ -15,10 +15,11 @@ src = 0, dst = 2, k = 1
 <strong>Output:</strong> 200
 <strong>Explanation:</strong> 
 The graph looks like this:
-<img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/02/16/995.png" style="height:180px; width:246px" />
 
 The cheapest price from city <code>0</code> to city <code>2</code> with at most 1 stop costs 200, as marked red in the picture.</pre>
 
+![](./images/995.png)
+
 <pre>
 <strong>Example 2:</strong>
 <strong>Input:</strong> 
@@ -27,10 +28,11 @@ src = 0, dst = 2, k = 0
 <strong>Output:</strong> 500
 <strong>Explanation:</strong> 
 The graph looks like this:
-<img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/02/16/995.png" style="height:180px; width:246px" />
 
 The cheapest price from city <code>0</code> to city <code>2</code> with at most 0 stop costs 500, as marked blue in the picture.</pre>
 
+![](./images/995.png)
+
 <p><strong>Note:</strong></p>
 
 <ul>

solution/0700-0799/0799.Champagne Tower/README.md

@@ -10,7 +10,7 @@
 
 <p>例如，在倾倒一杯香槟后，最顶层的玻璃杯满了。倾倒了两杯香槟后，第二层的两个玻璃杯各自盛放一半的香槟。在倒三杯香槟后，第二层的香槟满了 - 此时总共有三个满的玻璃杯。在倒第四杯后，第三层中间的玻璃杯盛放了一半的香槟，他两边的玻璃杯各自盛放了四分之一的香槟，如下图所示。</p>
 
-<p><img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/03/09/tower.png" style="height:200px; width:290px" /></p>
+![](./images/tower.png)
 
 <p>现在当倾倒了非负整数杯香槟后，返回第 i 行 j 个玻璃杯所盛放的香槟占玻璃杯容积的比例（i 和 j都从0开始）。</p>
 

solution/0700-0799/0799.Champagne Tower/README_EN.md

@@ -13,11 +13,7 @@
 
 <p>For example, after one cup of champagne is poured, the top most glass is full.&nbsp; After two cups of champagne are poured, the two glasses on the second row are half full.&nbsp; After three cups of champagne are poured, those two cups become full - there are 3 full glasses total now.&nbsp; After four cups of champagne are poured, the third row has the middle glass half full, and the two outside glasses are a quarter full, as pictured below.</p>
 
-
-
-<p><img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/03/09/tower.png" style="height:200px; width:290px" /></p>
-
-
+![](./images/tower.png)
 
 <p>Now after pouring some non-negative integer cups of champagne, return how full the j-th glass in the i-th row is (both i and j are 0 indexed.)</p>
 
@@ -60,11 +56,8 @@
 
 
 <ul>
-
 	<li><code>poured</code>&nbsp;will&nbsp;be&nbsp;in the range of <code>[0, 10 ^ 9]</code>.</li>
-
 	<li><code>query_glass</code> and <code>query_row</code> will be in the range of <code>[0, 99]</code>.</li>
-
 </ul>
 
 

solution/0700-0799/0799.Champagne Tower/images/tower.png

@@ -20,7 +20,7 @@
 
 </pre>
 
-<p><img alt="Illustration of graph" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/03/17/picture1.png" style="height:86px; width:300px" /></p>
+![](./images/picture1.png)
 
 <p><strong>提示：</strong></p>
 

solution/0800-0899/0802.Find Eventual Safe States/README.md

@@ -34,8 +34,7 @@ Here is a diagram of the above graph.
 </pre>
 
 
-
-<p><img alt="Illustration of graph" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/03/17/picture1.png" style="height:86px; width:300px" /></p>
+![](./images/picture1.png)
 
 
 
@@ -44,13 +43,9 @@ Here is a diagram of the above graph.
 
 
 <ul>
-
 	<li><code>graph</code> will have length at most <code>10000</code>.</li>
-
 	<li>The number of edges in the graph will not exceed <code>32000</code>.</li>
-
 	<li>Each <code>graph[i]</code> will be a sorted list of different integers, chosen within the range <code>[0, graph.length - 1]</code>.</li>
-
 </ul>
 
 

solution/0800-0899/0802.Find Eventual Safe States/README_EN.md

@@ -14,7 +14,7 @@
 这五个点如下图所示。组成的橙色三角形是最大的，面积为2。
 </pre>
 
-<p><img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/04/04/1027.png" style="height:328px; width:400px" /></p>
+![](./images/1027.png)
 
 <p><strong>注意: </strong></p>
 

solution/0800-0899/0802.Find Eventual Safe States/images/picture1.png

@@ -21,26 +21,18 @@ The five points are show in the figure below. The red triangle is the largest.
 
 </pre>
 
-
-
-<p><img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/04/04/1027.png" style="height:328px; width:400px" /></p>
-
+![](./images/1027.png)
 
 
 <p><strong>Notes: </strong></p>
 
 
 
 <ul>
-
 	<li><code>3 &lt;= points.length &lt;= 50</code>.</li>
-
 	<li>No points will be duplicated.</li>
-
 	<li>&nbsp;<code>-50 &lt;= points[i][j] &lt;= 50</code>.</li>
-
 	<li>Answers within&nbsp;<code>10^-6</code>&nbsp;of the true value will be accepted as correct.</li>
-
 </ul>
 
 

solution/0800-0899/0812.Largest Triangle Area/README.md

@@ -18,28 +18,28 @@
 <strong>解释:</strong> 
 只有红色节点满足条件&ldquo;所有不包含 1 的子树&rdquo;。
 右图为返回的答案。
-
-<img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/04/06/1028_2.png" style="width:450px" />
 </pre>
 
+![](./images/1028_2.png)
+
 <pre>
 <strong>示例2:</strong>
 <strong>输入:</strong> [1,0,1,0,0,0,1]
 <strong>输出: </strong>[1,null,1,null,1]
 
-
-<img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/04/06/1028_1.png" style="width:450px" />
 </pre>
 
+![](./images/1028_1.png)
+
 <pre>
 <strong>示例3:</strong>
 <strong>输入:</strong> [1,1,0,1,1,0,1,0]
 <strong>输出: </strong>[1,1,0,1,1,null,1]
 
-
-<img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/04/05/1028.png" style="width:450px" />
 </pre>
 
+![](./images/1028.png)
+
 <p><strong>说明: </strong></p>
 
 <ul>

solution/0800-0899/0812.Largest Triangle Area/README_EN.md

@@ -31,13 +31,9 @@ Only the red nodes satisfy the property "every subtree not containing a 1&q
 
 The diagram on the right represents the answer.
 
-
-
-<img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/04/06/1028_2.png" style="width:450px" />
-
 </pre>
 
-
+![](./images/1028_2.png)
 
 <pre>
 
@@ -47,15 +43,9 @@ The diagram on the right represents the answer.
 
 <strong>Output: </strong>[1,null,1,null,1]
 
-
-
-
-
-<img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/04/06/1028_1.png" style="width:450px" />
-
 </pre>
 
-
+![](./images/1028_1.png)
 
 <pre>
 
@@ -65,26 +55,17 @@ The diagram on the right represents the answer.
 
 <strong>Output: </strong>[1,1,0,1,1,null,1]
 
-
-
-
-
-<img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/04/05/1028.png" style="width:450px" />
-
 </pre>
 
-
+![](./images/1028.png)
 
 <p><strong>Note: </strong></p>
 
 
 
 <ul>
-
 	<li>The binary tree&nbsp;will&nbsp;have&nbsp;at&nbsp;most <code>100 nodes</code>.</li>
-
 	<li>The value of each node will only be <code>0</code> or <code>1</code>.</li>
-
 </ul>
 
 

solution/0800-0899/0812.Largest Triangle Area/images/1027.png

@@ -8,7 +8,7 @@
 
 <p>找出平面中所有矩形叠加覆盖后的总面积。 由于答案可能太大，<strong>请返回它对 10 ^ 9 + 7 取模的结果</strong>。</p>
 
-<p><img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/06/06/rectangle_area_ii_pic.png" style="height: 360px; width: 480px;"></p>
+![](./images/rectangle_area_ii_pic.png)
 
 <p><strong>示例 1：</strong></p>
 

solution/0800-0899/0814.Binary Tree Pruning/README.md

@@ -10,10 +10,7 @@
 <p>Find the total area covered by all <code>rectangles</code> in the plane.&nbsp; Since the answer&nbsp;may be too large, <strong>return it modulo 10^9 + 7</strong>.</p>
 
 
-
-<p><img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/06/06/rectangle_area_ii_pic.png" style="width: 480px; height: 360px;" /></p>
-
-
+![](./images/rectangle_area_ii_pic.png)
 
 <p><strong>Example 1:</strong></p>
 
@@ -52,15 +49,10 @@
 
 
 <ul>
-
 	<li><code>1 &lt;= rectangles.length &lt;= 200</code></li>
-
 	<li><code><font face="monospace">rectanges[i].length = 4</font></code></li>
-
 	<li><code>0 &lt;= rectangles[i][j] &lt;= 10^9</code></li>
-
 	<li>The total area covered by all rectangles will never exceed&nbsp;<code>2^63 - 1</code>&nbsp;and thus will fit in a 64-bit signed integer.</li>
-
 </ul>
 
 

solution/0800-0899/0814.Binary Tree Pruning/README_EN.md

@@ -23,12 +23,13 @@
 所求结点为与目标结点（值为 5）距离为 2 的结点，
 值分别为 7，4，以及 1
 
-<img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/06/28/sketch0.png" style="height: 240px; width: 280px;">
 
 注意，输入的 &quot;root&quot; 和 &quot;target&quot; 实际上是树上的结点。
 上面的输入仅仅是对这些对象进行了序列化描述。
 </pre>
 
+![](./images/sketch0.png)
+
 <p>&nbsp;</p>
 
 <p><strong>提示：</strong></p>

solution/0800-0899/0814.Binary Tree Pruning/images/1028.png

@@ -45,17 +45,13 @@ have values 7, 4, and 1.
 
 
 
-<img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/06/28/sketch0.png" style="width: 280px; height: 240px;" />
-
-
-
 Note that the inputs &quot;root&quot; and &quot;target&quot; are actually TreeNodes.
 
 The descriptions of the inputs above are just serializations of these objects.
 
 </pre>
 
-
+![](./images/sketch0.png)
 
 <p>&nbsp;</p>
 
@@ -66,22 +62,15 @@ The descriptions of the inputs above are just serializations of these objects.
 
 
 <ol>
-
 	<li>The given tree is non-empty.</li>
-
 	<li>Each node in the tree has unique values&nbsp;<code>0 &lt;= node.val &lt;= 500</code>.</li>
-
 	<li>The <code>target</code>&nbsp;node is a node in the tree.</li>
-
 	<li><code>0 &lt;= K &lt;= 1000</code>.</li>
-
 </ol>
 
 </div>
 
 
-
-
 ## Solutions
 
 

solution/0800-0899/0814.Binary Tree Pruning/images/1028_1.png

@@ -16,10 +16,14 @@
 
 <p><strong>示例：</strong></p>
 
+
+![](./images/sketch1.png)
+
+
 <pre><strong>输入：</strong>[3,5,1,6,2,0,8,null,null,7,4]
 <strong>输出：</strong>[2,7,4]
 <strong>解释：</strong>
-<img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/07/01/sketch1.png" style="height: 238px; width: 280px;">
+
 我们返回值为 2 的结点，在图中用黄色标记。
 在图中用蓝色标记的是树的最深的结点。
 输入 &quot;[3, 5, 1, 6, 2, 0, 8, null, null, 7, 4]&quot; 是对给定的树的序列化表述。

solution/0800-0899/0814.Binary Tree Pruning/images/1028_2.png

@@ -25,7 +25,7 @@
 
 <p><strong>Example 1:</strong></p>
 
-
+![](./images/sketch1.png)
 
 <pre>
 
@@ -37,8 +37,6 @@
 
 </strong>
 
-<img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/07/01/sketch1.png" style="width: 280px; height: 238px;" />
-
 
 
 We return the node with value 2, colored in yellow in the diagram.
@@ -64,11 +62,8 @@ Both the input and output have TreeNode type.
 
 
 <ul>
-
 	<li>The number of nodes in the tree will be between 1 and 500.</li>
-
 	<li>The values of each node are unique.</li>
-
 </ul>
 
 

solution/0800-0899/0850.Rectangle Area II/README.md

@@ -6,7 +6,7 @@
 <!-- 这里写题目描述 -->
 <p>请考虑一颗二叉树上所有的叶子，这些叶子的值按从左到右的顺序排列形成一个&nbsp;<em>叶值序列</em> 。</p>
 
-<p><img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/07/16/tree.png" style="height: 240px; width: 300px;"></p>
+![](./images/tree.png)
 
 <p>举个例子，如上图所示，给定一颗叶值序列为&nbsp;<code>(6, 7, 4, 9, 8)</code>&nbsp;的树。</p>