fix: update images path

Author: yanglbme

solution/0000-0099/0011.Container With Most Water/README.md

@@ -10,7 +10,7 @@
 
 <p>&nbsp;</p>
 
-<p><img alt="" src="https://aliyun-lc-upload.oss-cn-hangzhou.aliyuncs.com/aliyun-lc-upload/uploads/2018/07/25/question_11.jpg" style="height: 287px; width: 600px;"></p>
+![](./images/question_11.jpg)
 
 <p><small>图中垂直线代表输入数组 [1,8,6,2,5,4,8,3,7]。在此情况下，容器能够容纳水（表示为蓝色部分）的最大值为&nbsp;49。</small></p>
 

solution/0000-0099/0011.Container With Most Water/README_EN.md

@@ -13,10 +13,7 @@
 
 <p>&nbsp;</p>
 
-
-
-<p><img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/07/17/question_11.jpg" style="width: 600px; height: 287px;" /></p>
-
+![](./images/question_11.jpg)
 
 
 <p><small>The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain&nbsp;is 49. </small></p>

solution/0000-0099/0011.Container With Most Water/images/question_11.jpg

@@ -19,7 +19,7 @@
 <strong>Explanation:</strong> There is a cycle in the linked list, where tail connects to the second node.
 </pre>
 
-<p><img alt="" src="https://assets.leetcode.com/uploads/2018/12/07/circularlinkedlist.png" style="height: 97px; width: 300px;" /></p>
+![](./images/circularlinkedlist.png)
 
 <p><strong>Example 2:</strong></p>
 
@@ -29,7 +29,7 @@
 <strong>Explanation:</strong> There is a cycle in the linked list, where tail connects to the first node.
 </pre>
 
-<p><img alt="" src="https://assets.leetcode.com/uploads/2018/12/07/circularlinkedlist_test2.png" style="height: 74px; width: 141px;" /></p>
+![](./images/circularlinkedlist_test2.png)
 
 <p><strong>Example 3:</strong></p>
 
@@ -39,7 +39,7 @@
 <strong>Explanation:</strong> There is no cycle in the linked list.
 </pre>
 
-<p><img alt="" src="https://assets.leetcode.com/uploads/2018/12/07/circularlinkedlist_test3.png" style="height: 45px; width: 45px;" /></p>
+![](./images/circularlinkedlist_test3.png)
 
 <p>&nbsp;</p>
 

solution/0100-0199/0142.Linked List Cycle II/README_EN.md

@@ -10,10 +10,7 @@
 <p>Given linked list --&nbsp;head =&nbsp;[4,5,1,9], which looks like following:</p>
 
 
-
-<p><img alt="" src="https://assets.leetcode.com/uploads/2018/12/28/237_example.png" style="margin-top: 5px; margin-bottom: 5px; width: 300px; height: 49px;" /></p>
-
-
+![](./images/237_example.png)
 
 <p>&nbsp;</p>
 

solution/0200-0299/0237.Delete Node in a Linked List/README_EN.md

@@ -12,19 +12,19 @@
 
 <p>给定下面这个<code>8 x 8</code>&nbsp;网络，我们将这样建立一个对应的四叉树：</p>
 
-<p><img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/02/01/962_grid.png" style="height:27%; width:27%" /></p>
+![](./images/962_grid.png)
 
 <p>由上文的定义，它能被这样分割：</p>
 
-<p><img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/02/01/962_grid_divided.png" style="height:100%; width:100%" /></p>
+![](./images/962_grid_divided.png)
 
 <p>&nbsp;</p>
 
 <p>对应的四叉树应该像下面这样，每个结点由一对&nbsp;<code>(isLeaf, val)</code>&nbsp;所代表.</p>
 
 <p>对于非叶子结点，<code>val</code>&nbsp;可以是任意的，所以使用&nbsp;<code>*</code>&nbsp;代替。</p>
 
-<p><img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/02/01/962_quad_tree.png" style="height:100%; width:100%" /></p>
+![](./images/962_quad_tree.png)
 
 <p><strong>提示：</strong></p>
 

solution/0400-0499/0427.Construct Quad Tree/README.md

@@ -33,7 +33,9 @@ class Node {
 	<li>If the current grid has different values, set <code>isLeaf</code> to False and&nbsp;set <code>val</code> to any value and divide the current grid into four sub-grids as shown in the photo.</li>
 	<li>Recurse for each of the children with the proper sub-grid.</li>
 </ol>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/02/11/new_top.png" style="width: 777px; height: 181px;" />
+
+![](./images/new_top.png)
+
 <p>If you want to know more about the Quad-Tree, you can refer to the&nbsp;<a href="https://en.wikipedia.org/wiki/Quadtree">wiki</a>.</p>
 
 <p><strong>Quad-Tree&nbsp;format:</strong></p>
@@ -46,18 +48,21 @@ class Node {
 
 <p>&nbsp;</p>
 <p><strong>Example 1:</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/02/11/grid1.png" style="width: 777px; height: 99px;" />
+
+![](./images/grid1.png)
+
 <pre>
 <strong>Input:</strong> grid = [[0,1],[1,0]]
 <strong>Output:</strong> [[0,1],[1,0],[1,1],[1,1],[1,0]]
 <strong>Explanation:</strong> The explanation of this example is shown below:
 Notice that 0 represnts False and 1 represents True in the photo representing the Quad-Tree.
-<img alt="" src="https://assets.leetcode.com/uploads/2020/02/12/e1tree.png" style="width: 777px; height: 186px;" />
 </pre>
 
+![](./images/e1tree.png)
+
 <p><strong>Example 2:</strong></p>
 
-<p><img alt="" src="https://assets.leetcode.com/uploads/2020/02/12/e2mat.png" style="width: 777px; height: 343px;" /></p>
+![](./images/e2mat.png)
 
 <pre>
 <strong>Input:</strong> grid = [[1,1,1,1,0,0,0,0],[1,1,1,1,0,0,0,0],[1,1,1,1,1,1,1,1],[1,1,1,1,1,1,1,1],[1,1,1,1,0,0,0,0],[1,1,1,1,0,0,0,0],[1,1,1,1,0,0,0,0],[1,1,1,1,0,0,0,0]]
@@ -66,9 +71,10 @@ Notice that 0 represnts False and 1 represents True in the photo representing th
 The topLeft, bottomLeft and bottomRight each has the same value.
 The topRight have different values so we divide it into 4 sub-grids where each has the same value.
 Explanation is shown in the photo below:
-<img alt="" src="https://assets.leetcode.com/uploads/2020/02/12/e2tree.png" style="width: 777px; height: 328px;" />
 </pre>
 
+![](./images/e2tree.png)
+
 <p><strong>Example 3:</strong></p>
 
 <pre>

solution/0400-0499/0427.Construct Quad Tree/README_EN.md

@@ -15,14 +15,16 @@
 <strong>Output:</strong> [1,2,3,7,8,11,12,9,10,4,5,6]
 <strong>Explanation:
 </strong>
-The multilevel linked list in the input is as follows:
+The multilevel linked list in the input is as follows:</pre>
 
-<img src="https://assets.leetcode.com/uploads/2018/10/12/multilevellinkedlist.png" style="width: 640px;" />
 
-After flattening the multilevel linked list it becomes:
+![](./images/multilevellinkedlist.png)
+
+<pre>
+After flattening the multilevel linked list it becomes:</pre>
+
+![](./images/multilevellinkedlistflattened.png)
 
-<img src="https://assets.leetcode.com/uploads/2018/10/12/multilevellinkedlistflattened.png" style="width: 1100px;" />
-</pre>
 
 <p><strong>Example 2:</strong></p>
 

solution/0400-0499/0427.Construct Quad Tree/images/962_grid.png

@@ -35,7 +35,9 @@ class Node {
 	<li>If the current grid has different values, set <code>isLeaf</code> to False and&nbsp;set <code>val</code> to any value and divide the current grid into four sub-grids as shown in the photo.</li>
 	<li>Recurse for each of the children with the proper sub-grid.</li>
 </ol>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/02/11/new_top.png" style="width: 777px; height: 181px;" />
+
+![](./images/new_top.png)
+
 <p>If you want to know more about the Quad-Tree, you can refer to the&nbsp;<a href="https://en.wikipedia.org/wiki/Quadtree">wiki</a>.</p>
 
 <p><strong>Quad-Tree&nbsp;format:</strong></p>
@@ -48,17 +50,22 @@ class Node {
 
 <p>&nbsp;</p>
 <p><strong>Example 1:</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/02/11/qt1.png" style="width: 550px; height: 196px;" /> <img alt="" src="https://assets.leetcode.com/uploads/2020/02/11/qt2.png" style="width: 550px; height: 278px;" />
+
+![](./images/qt1.png)
+
+![](./images/qt2.png)
+
 <pre>
 <strong>Input:</strong> quadTree1 = [[0,1],[1,1],[1,1],[1,0],[1,0]]
 , quadTree2 = [[0,1],[1,1],[0,1],[1,1],[1,0],null,null,null,null,[1,0],[1,0],[1,1],[1,1]]
 <strong>Output:</strong> [[0,0],[1,1],[1,1],[1,1],[1,0]]
 <strong>Explanation:</strong> quadTree1 and quadTree2 are shown above. You can see the binary matrix which is represented by each Quad-Tree.
 If we apply logical bitwise OR on the two binary matrices we get the binary matrix below which is represented by the result Quad-Tree.
 Notice that the binary matrices shown are only for illustration, you don&#39;t have to construct the binary matrix to get the result tree.
-<img alt="" src="https://assets.leetcode.com/uploads/2020/02/11/qtr.png" style="width: 777px; height: 222px;" />
 </pre>
 
+![](./images/qtr.png)
+
 <p><strong>Example 2:</strong></p>
 
 <pre>

solution/0400-0499/0427.Construct Quad Tree/images/962_grid_divided.png

@@ -35,9 +35,7 @@
 
 
 
-<p><b><img alt="" src="https://assets.leetcode.com/uploads/2019/04/05/diag1b.png" style="width: 500px; height: 218px;" /></b></p>
-
-
+![](./images/diag1b.png)
 
 <pre>
 
@@ -72,13 +70,9 @@ So function 0 spends 2 + 1 = 3 units of total time executing, and function 1 spe
 
 
 <ol>
-
 	<li><code>1 &lt;= n &lt;= 100</code></li>
-
 	<li>Two functions won&#39;t start or end at the same time.</li>
-
 	<li>Functions will always log when they exit.</li>
-
 </ol>
 
 

solution/0400-0499/0427.Construct Quad Tree/images/962_quad_tree.png

@@ -22,10 +22,7 @@
 <p><strong>Example 1:</strong></p>
 
 
-
-<p><img alt="" src="https://assets.leetcode.com/uploads/2019/05/23/931_example_1.png" style="width: 200px; height: 220px;" /></p>
-
-
+![](./images/931_example_1.png)
 
 <pre>
 
@@ -46,15 +43,10 @@
 
 
 <ol>
-
 	<li><code>N</code> will be in the range <code>[1, 100]</code>.</li>
-
 	<li><code>K</code> will be in the range <code>[1, N]</code>.</li>
-
 	<li>The length of <code>times</code> will be in the range <code>[1, 6000]</code>.</li>
-
 	<li>All edges <code>times[i] = (u, v, w)</code> will have <code>1 &lt;= u, v &lt;= N</code> and <code>0 &lt;= w &lt;= 100</code>.</li>
-
 </ol>
 
 

solution/0400-0499/0427.Construct Quad Tree/images/e1tree.png

@@ -8,7 +8,7 @@
 
 <p>在开始时，我们同时把一些多米诺骨牌向左或向右推。</p>
 
-<p><img alt="" src="https://aliyun-lc-upload.oss-cn-hangzhou.aliyuncs.com/aliyun-lc-upload/uploads/2018/05/19/domino.png" style="height: 160px; width: 418px;"></p>
+![](./images/domino.png)
 
 <p>每过一秒，倒向左边的多米诺骨牌会推动其左侧相邻的多米诺骨牌。</p>
 

solution/0400-0499/0427.Construct Quad Tree/images/e2mat.png

@@ -9,11 +9,7 @@
 
 <p>In the beginning, we simultaneously push&nbsp;some of the dominoes either to the left or to the right.</p>
 
-
-
-<p><img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/05/18/domino.png" style="height: 160px;" /></p>
-
-
+![](./images/domino.png)
 
 <p>After each second, each domino that is falling to the left pushes the adjacent domino on the left.</p>
 
@@ -74,11 +70,8 @@
 
 
 <ol>
-
 	<li><code>0 &lt;= N&nbsp;&lt;= 10^5</code></li>
-
 	<li>String&nbsp;<code>dominoes</code> contains only&nbsp;<code>&#39;L</code>&#39;, <code>&#39;R&#39;</code> and <code>&#39;.&#39;</code></li>
-
 </ol>
 
 

solution/0400-0499/0427.Construct Quad Tree/images/e2tree.png

@@ -17,7 +17,9 @@
 <pre><strong>输入： </strong>p = 2, q = 1
 <strong>输出： </strong>2
 <strong>解释： </strong>这条光线在第一次被反射回左边的墙时就遇到了接收器 2 。
-<img alt="" src="https://ibb.co/mYSFJT"><img alt="" src="https://aliyun-lc-upload.oss-cn-hangzhou.aliyuncs.com/aliyun-lc-upload/uploads/2018/06/22/reflection.png" style="height: 217px; width: 218px;"></pre>
+</pre>
+
+![](./images/reflection.png)
 
 <p>&nbsp;</p>
 

solution/0400-0499/0427.Construct Quad Tree/images/grid1.png

@@ -33,11 +33,10 @@
 
 <strong>Explanation: </strong>The ray meets receptor 2 the first time it gets reflected back to the left wall.
 
-<p><img alt="" src="https://ibb.co/mYSFJT" /><img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/06/18/reflection.png" style="width: 218px; height: 217px;" /></p>
-
 </pre>
 
 
+![](./images/reflection.png)
 
 
 
@@ -46,11 +45,8 @@
 
 
 <ol>
-
 	<li><code>1 &lt;= p &lt;= 1000</code></li>
-
 	<li><code>0 &lt;= q &lt;= p</code></li>
-
 </ol>
 
 </div>

solution/0400-0499/0427.Construct Quad Tree/images/new_top.png

@@ -13,7 +13,7 @@
 
 <br>
 
-<img src="https://assets.leetcode.com/uploads/2019/10/20/hint_transpose.png" width="700"/>
+![](./images/hint_transpose.png)
 
 
 
@@ -62,11 +62,8 @@
 
 
 <ol>
-
 	<li><code><span>1 &lt;= A.length&nbsp;&lt;= 1000</span></code></li>
-
 	<li><code><span>1 &lt;= A[0].length&nbsp;&lt;= 1000</span></code></li>
-
 </ol>
 
 </div>

solution/0400-0499/0430.Flatten a Multilevel Doubly Linked List/README_EN.md

@@ -23,19 +23,20 @@
 <pre><strong>输入：</strong>R = 1, C = 4, r0 = 0, c0 = 0
 <strong>输出：</strong>[[0,0],[0,1],[0,2],[0,3]]
 
-<img alt="" src="https://aliyun-lc-upload.oss-cn-hangzhou.aliyuncs.com/aliyun-lc-upload/uploads/2018/08/24/example_1.png" style="height: 99px; width: 174px;">
 </pre>
 
+![](./images/example_1.png)
+
 <p>&nbsp;</p>
 
 <p><strong>示例 2：</strong></p>
 
 <pre><strong>输入：</strong>R = 5, C = 6, r0 = 1, c0 = 4
 <strong>输出：</strong>[[1,4],[1,5],[2,5],[2,4],[2,3],[1,3],[0,3],[0,4],[0,5],[3,5],[3,4],[3,3],[3,2],[2,2],[1,2],[0,2],[4,5],[4,4],[4,3],[4,2],[4,1],[3,1],[2,1],[1,1],[0,1],[4,0],[3,0],[2,0],[1,0],[0,0]]
-
-<img alt="" src="https://aliyun-lc-upload.oss-cn-hangzhou.aliyuncs.com/aliyun-lc-upload/uploads/2018/08/24/example_2.png" style="height: 142px; width: 202px;">
 </pre>
 
+![](./images/example_2.png)
+
 <p>&nbsp;</p>
 
 <p><strong>提示：</strong></p>