fix: update images path

Author: yanglbme

solution/0400-0499/0463.Island Perimeter/README.md

@@ -24,9 +24,9 @@
 
 <strong>解释:</strong> 它的周长是下面图片中的 16 个黄色的边：
 
-<img src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/10/12/island.png">
 </pre>
 
+![](./images/island.png)
 
 
 ## 解法

solution/0400-0499/0463.Island Perimeter/README_EN.md

@@ -43,13 +43,9 @@
 
 <strong>Explanation:</strong> The perimeter is the 16 yellow stripes in the image below:
 
-
-
-<img src="https://assets.leetcode.com/uploads/2018/10/12/island.png" style="width: 221px; height: 213px;" />
-
 </pre>
 
-
+![](./images/island.png)
 
 
 ## Solutions

solution/0400-0499/0463.Island Perimeter/images/island.png

@@ -20,9 +20,11 @@
 <strong>输出:</strong>  [1,2,4,7,5,3,6,8,9]
 
 <strong>解释:</strong>
-<img src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/10/12/diagonal_traverse.png" style="width: 220px;">
+
 </pre>
 
+![](./images/diagonal_traverse.png)
+
 <p>&nbsp;</p>
 
 <p><strong>说明:</strong></p>

solution/0400-0499/0498.Diagonal Traverse/README.md

@@ -36,11 +36,9 @@
 
 
 <b>Explanation:</b>
-
-<img src="https://assets.leetcode.com/uploads/2018/10/12/diagonal_traverse.png" style="width: 220px;" />
-
 </pre>
 
+![](./images/diagonal_traverse.png)
 
 
 <p>&nbsp;</p>

solution/0400-0499/0498.Diagonal Traverse/README_EN.md

@@ -11,10 +11,7 @@
 <p>&nbsp;</p>
 
 
-
-<p><img alt="American keyboard" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/10/12/keyboard.png" style="width: 100%; max-width: 600px"></p>
-
-
+![](./images/keyboard.png)
 
 <p>&nbsp;</p>
 
@@ -41,11 +38,8 @@
 
 
 <ol>
-
 	<li>你可以重复使用键盘上同一字符。</li>
-
 	<li>你可以假设输入的字符串将只包含字母。</li>
-
 </ol>
 
 

solution/0400-0499/0498.Diagonal Traverse/images/diagonal_traverse.png

@@ -11,7 +11,7 @@
 
 
 
-<p><img alt="" src="https://assets.leetcode.com/uploads/2018/10/12/keyboard.png" style="width: 100%; max-width: 600px" /></p>
+![](./images/keyboard.png)
 
 &nbsp;
 
@@ -40,11 +40,8 @@
 
 
 <ol>
-
 	<li>You may use one character in the keyboard more than once.</li>
-
 	<li>You may assume the input string will only contain letters of alphabet.</li>
-
 </ol>
 
 

solution/0500-0599/0500.Keyboard Row/README.md

@@ -21,11 +21,8 @@
 
 
 <ol>
-
 	<li>您可以将&nbsp;<strong>ring&nbsp;</strong>顺时针或逆时针旋转<strong>一个位置</strong>，计为1步。旋转的最终目的是将字符串&nbsp;<strong>ring&nbsp;</strong>的一个字符与 12:00 方向对齐，并且这个字符必须等于字符&nbsp;<strong>key[i] 。</strong></li>
-
 	<li>如果字符&nbsp;<strong>key[i]&nbsp;</strong>已经对齐到12:00方向，您需要按下中心按钮进行拼写，这也将算作&nbsp;<strong>1 步</strong>。按完之后，您可以开始拼写&nbsp;<strong>key&nbsp;</strong>的下一个字符（下一阶段）, 直至完成所有拼写。</li>
-
 </ol>
 
 
@@ -38,7 +35,7 @@
 
 
 
-<center><img src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/10/22/ring.jpg" style="width: 26%;"></center>
+![](./images/ring.jpg)
 
 &nbsp;
 
@@ -67,13 +64,9 @@
 
 
 <ol>
-
 	<li><strong>ring</strong> 和&nbsp;<strong>key</strong>&nbsp;的字符串长度取值范围均为&nbsp;1 至&nbsp;100；</li>
-
 	<li>两个字符串中都只有小写字符，并且均可能存在重复字符；</li>
-
 	<li>字符串&nbsp;<strong>key</strong>&nbsp;一定可以由字符串 <strong>ring</strong>&nbsp;旋转拼出。</li>
-
 </ol>
 
 

solution/0500-0599/0500.Keyboard Row/README_EN.md

@@ -20,20 +20,16 @@
 
 
 <ol>
-
 	<li>You can rotate the <b>ring</b> clockwise or anticlockwise <b>one place</b>, which counts as 1 step. The final purpose of the rotation is to align one of the string <b>ring&#39;s</b> characters at the 12:00 direction, where this character must equal to the character <b>key[i]</b>.</li>
-
 	<li>If the character <b>key[i]</b> has been aligned at the 12:00 direction, you need to press the center button to spell, which also counts as 1 step. After the pressing, you could begin to spell the next character in the key (next stage), otherwise, you&#39;ve finished all the spelling.</li>
-
 </ol>
 
 
 
 <p><b>Example:</b></p>
 
 
-
-<center><img src="https://assets.leetcode.com/uploads/2018/10/22/ring.jpg" style="width: 26%;" /></center>
+![](./images/ring.jpg)
 
 &nbsp;
 
@@ -64,13 +60,9 @@ So the final output is 4.
 
 
 <ol>
-
 	<li>Length of both ring and <b>key</b> will be in range 1 to 100.</li>
-
 	<li>There are only lowercase letters in both strings and might be some duplcate characters in both strings.</li>
-
 	<li>It&#39;s guaranteed that string <b>key</b> could always be spelled by rotating the string <b>ring</b>.</li>
-
 </ol>
 
 

solution/0500-0599/0500.Keyboard Row/images/keyboard.png

@@ -71,10 +71,11 @@ Click : [3,0]
 
 
 <strong>解释:</strong>
+</pre>
+
+![](./images/minesweeper_example_1.png)
 
-<img src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/10/12/minesweeper_example_1.png" style="width: 100%; max-width: 400px">
 
-</pre>
 
 
 
@@ -116,10 +117,10 @@ Click : [1,2]
 
 <strong>解释:</strong>
 
-<img src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/10/12/minesweeper_example_2.png" style="width: 100%; max-width: 400px">
-
 </pre>
 
+![](./images/minesweeper_example_2.png)
+
 
 
 <p>&nbsp;</p>
@@ -131,15 +132,10 @@ Click : [1,2]
 
 
 <ol>
-
 	<li>输入矩阵的宽和高的范围为 [1,50]。</li>
-
 	<li>点击的位置只能是未被挖出的方块 (&#39;M&#39; 或者 &#39;E&#39;)，这也意味着面板至少包含一个可点击的方块。</li>
-
 	<li>输入面板不会是游戏结束的状态（即有地雷已被挖出）。</li>
-
 	<li>简单起见，未提及的规则在这个问题中可被忽略。例如，当游戏结束时你不需要挖出所有地雷，考虑所有你可能赢得游戏或标记方块的情况。</li>
-
 </ol>
 
 

solution/0500-0599/0514.Freedom Trail/README.md

@@ -16,15 +16,10 @@
 
 
 <ol>
-
 	<li>If a mine (&#39;M&#39;) is revealed, then the game is over - change it to <b>&#39;X&#39;</b>.</li>
-
 	<li>If an empty square (&#39;E&#39;) with <b>no adjacent mines</b> is revealed, then change it to revealed blank (&#39;B&#39;) and all of its adjacent <b>unrevealed</b> squares should be revealed recursively.</li>
-
 	<li>If an empty square (&#39;E&#39;) with <b>at least one adjacent mine</b> is revealed, then change it to a digit (&#39;1&#39; to &#39;8&#39;) representing the number of adjacent mines.</li>
-
 	<li>Return the board when no more squares will be revealed.</li>
-
 </ol>
 
 
@@ -73,11 +68,11 @@ Click : [3,0]
 
 <b>Explanation:</b>
 
-<img src="https://assets.leetcode.com/uploads/2018/10/12/minesweeper_example_1.png" style="width: 100%; max-width: 400px" />
 
-</pre>
 
+</pre>
 
+![](./images/minesweeper_example_1.png)
 
 <p><b>Example 2:</b></p>
 
@@ -119,10 +114,9 @@ Click : [1,2]
 
 <b>Explanation:</b>
 
-<img src="https://assets.leetcode.com/uploads/2018/10/12/minesweeper_example_2.png" style="width: 100%; max-width: 400px" />
-
 </pre>
 
+![](./images/minesweeper_example_2.png)
 
 
 <p>&nbsp;</p>
@@ -134,15 +128,10 @@ Click : [1,2]
 
 
 <ol>
-
 	<li>The range of the input matrix&#39;s height and width is [1,50].</li>
-
 	<li>The click position will only be an unrevealed square (&#39;M&#39; or &#39;E&#39;), which also means the input board contains at least one clickable square.</li>
-
 	<li>The input board won&#39;t be a stage when game is over (some mines have been revealed).</li>
-
 	<li>For simplicity, not mentioned rules should be ignored in this problem. For example, you <b>don&#39;t</b> need to reveal all the unrevealed mines when the game is over, consider any cases that you will win the game or flag any squares.</li>
-
 </ol>
 
 

solution/0500-0599/0514.Freedom Trail/README_EN.md

@@ -48,11 +48,9 @@
 
 <strong>解释:</strong> 
 
-<img src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/10/12/brick_wall.png" style="width: 100%; max-width: 350px">
-
 </pre>
 
-
+![](./images/brick_wall.png)
 
 <p>&nbsp;</p>
 
@@ -63,11 +61,8 @@
 
 
 <ol>
-
 	<li>每一行砖块的宽度之和应该相等，并且不能超过 INT_MAX。</li>
-
 	<li>每一行砖块的数量在&nbsp;[1,10,000] 范围内，&nbsp;墙的高度在&nbsp;[1,10,000] 范围内，&nbsp;总的砖块数量不超过 20,000。</li>
-
 </ol>
 
 

solution/0500-0599/0514.Freedom Trail/images/ring.jpg

@@ -49,11 +49,10 @@
 
 <b>Explanation:</b> 
 
-<img src="https://assets.leetcode.com/uploads/2018/10/12/brick_wall.png" style="width: 100%; max-width: 350px" />
-
 </pre>
 
 
+![](./images/brick_wall.png)
 
 <p>&nbsp;</p>
 
@@ -64,11 +63,8 @@
 
 
 <ol>
-
 	<li>The width sum of bricks in different rows are the same and won&#39;t exceed INT_MAX.</li>
-
 	<li>The number of bricks in each row is in range [1,10,000]. The height of wall is in range [1,10,000]. Total number of bricks of the wall won&#39;t exceed 20,000.</li>
-
 </ol>
 
 

solution/0500-0599/0529.Minesweeper/README.md

@@ -19,9 +19,7 @@
 <p>&nbsp;</p>
 
 
-
-<p><img src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/10/12/narytreeexample.png" style="width: 100%; max-width: 300px;"></p>
-
+![](./images/narytreeexample.png)
 
 
 <p>&nbsp;</p>
@@ -37,11 +35,8 @@
 
 
 <ol>
-
 	<li>树的深度不会超过&nbsp;<code>1000</code>。</li>
-
 	<li>树的节点总不会超过&nbsp;<code>5000</code>。</li>
-
 </ol>
 
 

solution/0500-0599/0529.Minesweeper/README_EN.md

@@ -12,7 +12,7 @@
 <p>&nbsp;</p>
 <p><strong>Example 1:</strong></p>
 
-<p><img src="https://assets.leetcode.com/uploads/2018/10/12/narytreeexample.png" style="width: 100%; max-width: 300px;" /></p>
+![](./images/narytreeexample.png)
 
 <pre>
 <strong>Input:</strong> root = [1,null,3,2,4,null,5,6]
@@ -21,7 +21,7 @@
 
 <p><strong>Example 2:</strong></p>
 
-<p><img alt="" src="https://assets.leetcode.com/uploads/2019/11/08/sample_4_964.png" style="width: 296px; height: 241px;" /></p>
+![](./images/sample_4_964.png)
 
 <pre>
 <strong>Input:</strong> root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]

solution/0500-0599/0529.Minesweeper/images/minesweeper_example_1.png

@@ -22,11 +22,9 @@
 
 <strong>解释:</strong>
 
-<img src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/10/12/out_of_boundary_paths_1.png" style="width: 100%; max-width: 400px">
-
 </pre>
 
-
+![](./images/out_of_boundary_paths_1.png)
 
 <p><strong>示例 2：</strong></p>
 
@@ -38,11 +36,9 @@
 
 <strong>解释:</strong>
 
-<img src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/10/12/out_of_boundary_paths_2.png" style="width: 100%; max-width: 400px">
-
 </pre>
 
-
+![](./images/out_of_boundary_paths_2.png)
 
 <p>&nbsp;</p>
 
@@ -53,13 +49,9 @@
 
 
 <ol>
-
 	<li>球一旦出界，就不能再被移动回网格内。</li>
-
 	<li>网格的长度和高度在 [1,50] 的范围内。</li>
-
 	<li>N 在 [0,50] 的范围内。</li>
-
 </ol>