Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 95d4c9c

Browse files
committed
fix: update images path
1 parent f0380fe commit 95d4c9c

File tree

223 files changed

+298
-421
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

223 files changed

+298
-421
lines changed

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -10,7 +10,7 @@
1010

1111
<p>&nbsp;</p>
1212

13-
<p><imgalt=""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>
13+
![](./images/question_11.jpg)
1414

1515
<p><small>图中垂直线代表输入数组 [1,8,6,2,5,4,8,3,7]。在此情况下,容器能够容纳水(表示为蓝色部分)的最大值为&nbsp;49。</small></p>
1616

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

Lines changed: 1 addition & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -13,10 +13,7 @@
1313

1414
<p>&nbsp;</p>
1515

16-
17-
18-
<p><img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/07/17/question_11.jpg" style="width: 600px; height: 287px;" /></p>
19-
16+
![](./images/question_11.jpg)
2017

2118

2219
<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>
17.9 KB
Loading[フレーム]

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

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -19,7 +19,7 @@
1919
<strong>Explanation:</strong> There is a cycle in the linked list, where tail connects to the second node.
2020
</pre>
2121

22-
<p><imgalt=""src="https://assets.leetcode.com/uploads/2018/12/07/circularlinkedlist.png"style="height: 97px; width: 300px;" /></p>
22+
![](./images/circularlinkedlist.png)
2323

2424
<p><strong>Example 2:</strong></p>
2525

@@ -29,7 +29,7 @@
2929
<strong>Explanation:</strong> There is a cycle in the linked list, where tail connects to the first node.
3030
</pre>
3131

32-
<p><imgalt=""src="https://assets.leetcode.com/uploads/2018/12/07/circularlinkedlist_test2.png"style="height: 74px; width: 141px;" /></p>
32+
![](./images/circularlinkedlist_test2.png)
3333

3434
<p><strong>Example 3:</strong></p>
3535

@@ -39,7 +39,7 @@
3939
<strong>Explanation:</strong> There is no cycle in the linked list.
4040
</pre>
4141

42-
<p><imgalt=""src="https://assets.leetcode.com/uploads/2018/12/07/circularlinkedlist_test3.png"style="height: 45px; width: 45px;" /></p>
42+
![](./images/circularlinkedlist_test3.png)
4343

4444
<p>&nbsp;</p>
4545

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

Lines changed: 1 addition & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -10,10 +10,7 @@
1010
<p>Given linked list --&nbsp;head =&nbsp;[4,5,1,9], which looks like following:</p>
1111

1212

13-
14-
<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>
15-
16-
13+
![](./images/237_example.png)
1714

1815
<p>&nbsp;</p>
1916

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

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -12,19 +12,19 @@
1212

1313
<p>给定下面这个<code>8 x 8</code>&nbsp;网络,我们将这样建立一个对应的四叉树:</p>
1414

15-
<p><imgalt=""src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/02/01/962_grid.png"style="height:27%; width:27%" /></p>
15+
![](./images/962_grid.png)
1616

1717
<p>由上文的定义,它能被这样分割:</p>
1818

19-
<p><imgalt=""src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/02/01/962_grid_divided.png"style="height:100%; width:100%" /></p>
19+
![](./images/962_grid_divided.png)
2020

2121
<p>&nbsp;</p>
2222

2323
<p>对应的四叉树应该像下面这样,每个结点由一对&nbsp;<code>(isLeaf, val)</code>&nbsp;所代表.</p>
2424

2525
<p>对于非叶子结点,<code>val</code>&nbsp;可以是任意的,所以使用&nbsp;<code>*</code>&nbsp;代替。</p>
2626

27-
<p><imgalt=""src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/02/01/962_quad_tree.png"style="height:100%; width:100%" /></p>
27+
![](./images/962_quad_tree.png)
2828

2929
<p><strong>提示:</strong></p>
3030

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

Lines changed: 11 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -33,7 +33,9 @@ class Node {
3333
<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>
3434
<li>Recurse for each of the children with the proper sub-grid.</li>
3535
</ol>
36-
<img alt="" src="https://assets.leetcode.com/uploads/2020/02/11/new_top.png" style="width: 777px; height: 181px;" />
36+
37+
![](./images/new_top.png)
38+
3739
<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>
3840

3941
<p><strong>Quad-Tree&nbsp;format:</strong></p>
@@ -46,18 +48,21 @@ class Node {
4648

4749
<p>&nbsp;</p>
4850
<p><strong>Example 1:</strong></p>
49-
<img alt="" src="https://assets.leetcode.com/uploads/2020/02/11/grid1.png" style="width: 777px; height: 99px;" />
51+
52+
![](./images/grid1.png)
53+
5054
<pre>
5155
<strong>Input:</strong> grid = [[0,1],[1,0]]
5256
<strong>Output:</strong> [[0,1],[1,0],[1,1],[1,1],[1,0]]
5357
<strong>Explanation:</strong> The explanation of this example is shown below:
5458
Notice that 0 represnts False and 1 represents True in the photo representing the Quad-Tree.
55-
<img alt="" src="https://assets.leetcode.com/uploads/2020/02/12/e1tree.png" style="width: 777px; height: 186px;" />
5659
</pre>
5760

61+
![](./images/e1tree.png)
62+
5863
<p><strong>Example 2:</strong></p>
5964

60-
<p><imgalt=""src="https://assets.leetcode.com/uploads/2020/02/12/e2mat.png"style="width: 777px; height: 343px;" /></p>
65+
![](./images/e2mat.png)
6166

6267
<pre>
6368
<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
6671
The topLeft, bottomLeft and bottomRight each has the same value.
6772
The topRight have different values so we divide it into 4 sub-grids where each has the same value.
6873
Explanation is shown in the photo below:
69-
<img alt="" src="https://assets.leetcode.com/uploads/2020/02/12/e2tree.png" style="width: 777px; height: 328px;" />
7074
</pre>
7175

76+
![](./images/e2tree.png)
77+
7278
<p><strong>Example 3:</strong></p>
7379

7480
<pre>
2.56 KB
Loading[フレーム]
25.1 KB
Loading[フレーム]
46.2 KB
Loading[フレーム]

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /