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>