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>