Skip to content

Commit cac2fba

Browse files
yanglbmeyanglbme
committed
chore(lcof2): change images path
1 parent 3d0e4ad commit cac2fba

File tree

32 files changed

+56
-56
lines changed
  • lcof2
    • 剑指 Offer II 013. 二维子矩阵的和
    • 剑指 Offer II 021. 删除链表的倒数第 n 个结点
    • 剑指 Offer II 022. 链表中环的入口节点
    • 剑指 Offer II 023. 两个链表的第一个重合节点
    • 剑指 Offer II 024. 反转链表
    • 剑指 Offer II 025. 链表中的两数相加
    • 剑指 Offer II 026. 重排链表
    • 剑指 Offer II 027. 回文链表
    • 剑指 Offer II 028. 展平多级双向链表
    • 剑指 Offer II 029. 排序的循环链表
    • 剑指 Offer II 039. 直方图最大矩形面积
    • 剑指 Offer II 040. 矩阵中最大的矩形
    • 剑指 Offer II 045. 二叉树最底层最左边的值
    • 剑指 Offer II 046. 二叉树的右侧视图
    • 剑指 Offer II 047. 二叉树剪枝
    • 剑指 Offer II 048. 序列化与反序列化二叉树
    • 剑指 Offer II 049. 从根节点到叶节点的路径数字之和
    • 剑指 Offer II 050. 向下的路径节点之和
    • 剑指 Offer II 051. 节点之和最大的路径
    • 剑指 Offer II 052. 展平二叉搜索树
    • 剑指 Offer II 053. 二叉搜索树中的中序后继
    • 剑指 Offer II 055. 二叉搜索树迭代器
    • 剑指 Offer II 096. 字符串交织
    • 剑指 Offer II 098. 路径的数目
    • 剑指 Offer II 099. 最小路径之和
    • 剑指 Offer II 105. 岛屿的最大面积
    • 剑指 Offer II 106. 二分图
    • 剑指 Offer II 107. 矩阵中的距离
    • 剑指 Offer II 110. 所有路径
    • 剑指 Offer II 112. 最长递增路径
    • 剑指 Offer II 116. 朋友圈
    • 剑指 Offer II 118. 多余的边

32 files changed

+56
-56
lines changed

‎lcof2/剑指 Offer II 013. 二维子矩阵的和/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -21,7 +21,7 @@
2121

2222
<p><strong>示例 1：</strong></p>
2323

24-
<p><img src="https://pic.leetcode-cn.com/1626332422-wUpUHT-image.png" style="width: 200px;" /></p>
24+
<p><img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20013.%20%E4%BA%8C%E7%BB%B4%E5%AD%90%E7%9F%A9%E9%98%B5%E7%9A%84%E5%92%8C/images/1626332422-wUpUHT-image.png" style="width: 200px;" /></p>
2525

2626
<pre>
2727
<strong>输入:</strong>

‎lcof2/剑指 Offer II 021. 删除链表的倒数第 n 个结点/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -10,7 +10,7 @@
1010

1111
<p><strong>示例 1：</strong></p>
1212

13-
<p><img alt="" src="https://assets.leetcode.com/uploads/2020/10/03/remove_ex1.jpg" style="width: 542px; height: 222px;" /></p>
13+
<p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20021.%20%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E7%9A%84%E5%80%92%E6%95%B0%E7%AC%AC%20n%20%E4%B8%AA%E7%BB%93%E7%82%B9/images/remove_ex1.jpg" style="width: 542px; height: 222px;" /></p>
1414

1515
<pre>
1616
<strong>输入：</strong>head = [1,2,3,4,5], n = 2

‎lcof2/剑指 Offer II 022. 链表中环的入口节点/README.md

+3-3
Original file line numberDiff line numberDiff line change
@@ -17,7 +17,7 @@
1717

1818
<p><strong>示例 1：</strong></p>
1919

20-
<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/12/07/circularlinkedlist.png" style="height: 97px; width: 300px;" /></p>
20+
<p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20022.%20%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%8E%AF%E7%9A%84%E5%85%A5%E5%8F%A3%E8%8A%82%E7%82%B9/images/circularlinkedlist.png" style="height: 97px; width: 300px;" /></p>
2121

2222
<pre>
2323
<strong>输入：</strong>head = [3,2,0,-4], pos = 1
@@ -27,7 +27,7 @@
2727

2828
<p><strong>示例&nbsp;2：</strong></p>
2929

30-
<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/12/07/circularlinkedlist_test2.png" style="height: 74px; width: 141px;" /></p>
30+
<p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20022.%20%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%8E%AF%E7%9A%84%E5%85%A5%E5%8F%A3%E8%8A%82%E7%82%B9/images/circularlinkedlist_test2.png" style="height: 74px; width: 141px;" /></p>
3131

3232
<pre>
3333
<strong>输入：</strong>head = [1,2], pos = 0
@@ -37,7 +37,7 @@
3737

3838
<p><strong>示例 3：</strong></p>
3939

40-
<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/12/07/circularlinkedlist_test3.png" style="height: 45px; width: 45px;" /></p>
40+
<p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20022.%20%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%8E%AF%E7%9A%84%E5%85%A5%E5%8F%A3%E8%8A%82%E7%82%B9/images/circularlinkedlist_test3.png" style="height: 45px; width: 45px;" /></p>
4141

4242
<pre>
4343
<strong>输入：</strong>head = [1], pos = -1

‎lcof2/剑指 Offer II 023. 两个链表的第一个重合节点/README.md

+4-4
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@
88

99
<p>图示两个链表在节点 <code>c1</code> 开始相交<strong>：</strong></p>
1010

11-
<p><a href="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/12/14/160_statement.png" target="_blank"><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/12/14/160_statement.png" style="height: 130px; width: 400px;" /></a></p>
11+
<p><a href="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20023.%20%E4%B8%A4%E4%B8%AA%E9%93%BE%E8%A1%A8%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E9%87%8D%E5%90%88%E8%8A%82%E7%82%B9/images/160_statement.png" target="_blank"><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20023.%20%E4%B8%A4%E4%B8%AA%E9%93%BE%E8%A1%A8%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E9%87%8D%E5%90%88%E8%8A%82%E7%82%B9/images/160_statement.png" style="height: 130px; width: 400px;" /></a></p>
1212

1313
<p>题目数据 <strong>保证</strong> 整个链式结构中不存在环。</p>
1414

@@ -18,7 +18,7 @@
1818

1919
<p><strong>示例 1：</strong></p>
2020

21-
<p><a href="https://assets.leetcode.com/uploads/2018/12/13/160_example_1.png" target="_blank"><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/12/14/160_example_1.png" style="height: 130px; width: 400px;" /></a></p>
21+
<p><a href="https://assets.leetcode.com/uploads/2018/12/13/160_example_1.png" target="_blank"><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20023.%20%E4%B8%A4%E4%B8%AA%E9%93%BE%E8%A1%A8%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E9%87%8D%E5%90%88%E8%8A%82%E7%82%B9/images/160_example_1.png" style="height: 130px; width: 400px;" /></a></p>
2222

2323
<pre>
2424
<strong>输入：</strong>intersectVal = 8, listA = [4,1,8,4,5], listB = [5,0,1,8,4,5], skipA = 2, skipB = 3
@@ -30,7 +30,7 @@
3030

3131
<p><strong>示例&nbsp;2：</strong></p>
3232

33-
<p><a href="https://assets.leetcode.com/uploads/2018/12/13/160_example_2.png" target="_blank"><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/12/14/160_example_2.png" style="height: 136px; width: 350px;" /></a></p>
33+
<p><a href="https://assets.leetcode.com/uploads/2018/12/13/160_example_2.png" target="_blank"><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20023.%20%E4%B8%A4%E4%B8%AA%E9%93%BE%E8%A1%A8%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E9%87%8D%E5%90%88%E8%8A%82%E7%82%B9/images/160_example_2.png" style="height: 136px; width: 350px;" /></a></p>
3434

3535
<pre>
3636
<strong>输入：</strong>intersectVal&nbsp;= 2, listA = [0,9,1,2,4], listB = [3,2,4], skipA = 3, skipB = 1
@@ -42,7 +42,7 @@
4242

4343
<p><strong>示例&nbsp;3：</strong></p>
4444

45-
<p><a href="https://assets.leetcode.com/uploads/2018/12/13/160_example_3.png" target="_blank"><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/12/14/160_example_3.png" style="height: 126px; width: 200px;" /></a></p>
45+
<p><a href="https://assets.leetcode.com/uploads/2018/12/13/160_example_3.png" target="_blank"><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20023.%20%E4%B8%A4%E4%B8%AA%E9%93%BE%E8%A1%A8%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E9%87%8D%E5%90%88%E8%8A%82%E7%82%B9/images/160_example_3.png" style="height: 126px; width: 200px;" /></a></p>
4646

4747
<pre>
4848
<strong>输入：</strong>intersectVal = 0, listA = [2,6,4], listB = [1,5], skipA = 3, skipB = 2

‎lcof2/剑指 Offer II 024. 反转链表/README.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -11,14 +11,14 @@
1111
<p>&nbsp;</p>
1212

1313
<p><strong>示例 1：</strong></p>
14-
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/rev1ex1.jpg" style="width: 302px; " />
14+
<img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20024.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8/images/rev1ex1.jpg" style="width: 302px; " />
1515
<pre>
1616
<strong>输入：</strong>head = [1,2,3,4,5]
1717
<strong>输出：</strong>[5,4,3,2,1]
1818
</pre>
1919

2020
<p><strong>示例 2：</strong></p>
21-
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/rev1ex2.jpg" style="width: 102px;" />
21+
<img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20024.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8/images/rev1ex2.jpg" style="width: 102px;" />
2222
<pre>
2323
<strong>输入：</strong>head = [1,2]
2424
<strong>输出：</strong>[2,1]

‎lcof2/剑指 Offer II 025. 链表中的两数相加/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@
1212

1313
<p><strong>示例1：</strong></p>
1414

15-
<p><img alt="" src="https://pic.leetcode-cn.com/1626420025-fZfzMX-image.png" style="width: 302px; " /></p>
15+
<p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20025.%20%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E4%B8%A4%E6%95%B0%E7%9B%B8%E5%8A%A0/images/1626420025-fZfzMX-image.png" style="width: 302px; " /></p>
1616

1717
<pre>
1818
<strong>输入：</strong>l1 = [7,2,4,3], l2 = [5,6,4]

‎lcof2/剑指 Offer II 026. 重排链表/README.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -17,15 +17,15 @@
1717

1818
<p><strong>示例 1:</strong></p>
1919

20-
<p><img alt="" src="https://pic.leetcode-cn.com/1626420311-PkUiGI-image.png" style="width: 240px; " /></p>
20+
<p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20026.%20%E9%87%8D%E6%8E%92%E9%93%BE%E8%A1%A8/images/1626420311-PkUiGI-image.png" style="width: 240px; " /></p>
2121

2222
<pre>
2323
<strong>输入: </strong>head = [1,2,3,4]
2424
<strong>输出: </strong>[1,4,2,3]</pre>
2525

2626
<p><strong>示例 2:</strong></p>
2727

28-
<p><img alt="" src="https://pic.leetcode-cn.com/1626420320-YUiulT-image.png" style="width: 320px; " /></p>
28+
<p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20026.%20%E9%87%8D%E6%8E%92%E9%93%BE%E8%A1%A8/images/1626420320-YUiulT-image.png" style="width: 320px; " /></p>
2929

3030
<pre>
3131
<strong>输入: </strong>head = [1,2,3,4,5]

‎lcof2/剑指 Offer II 027. 回文链表/README.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -12,15 +12,15 @@
1212

1313
<p><strong>示例 1：</strong></p>
1414

15-
<p><strong><img alt="" src="https://pic.leetcode-cn.com/1626421737-LjXceN-image.png" /></strong></p>
15+
<p><strong><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20027.%20%E5%9B%9E%E6%96%87%E9%93%BE%E8%A1%A8/images/1626421737-LjXceN-image.png" /></strong></p>
1616

1717
<pre>
1818
<strong>输入:</strong> head = [1,2,3,3,2,1]
1919
<strong>输出:</strong> true</pre>
2020

2121
<p><strong>示例 2：</strong></p>
2222

23-
<p><strong><img alt="" src="https://pic.leetcode-cn.com/1626422231-wgvnWh-image.png" style="width: 138px; height: 62px;" /></strong></p>
23+
<p><strong><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20027.%20%E5%9B%9E%E6%96%87%E9%93%BE%E8%A1%A8/images/1626422231-wgvnWh-image.png" style="width: 138px; height: 62px;" /></strong></p>
2424

2525
<pre>
2626
<strong>输入:</strong> head = [1,2]

‎lcof2/剑指 Offer II 028. 展平多级双向链表/README.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -19,11 +19,11 @@
1919
</strong>
2020
输入的多级列表如下图所示：
2121

22-
<img src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/10/12/multilevellinkedlist.png" style="height: 363px; width: 640px;" />
22+
<img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20028.%20%E5%B1%95%E5%B9%B3%E5%A4%9A%E7%BA%A7%E5%8F%8C%E5%90%91%E9%93%BE%E8%A1%A8/images/multilevellinkedlist.png" style="height: 363px; width: 640px;" />
2323

2424
扁平化后的链表如下图：
2525

26-
<img src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/10/12/multilevellinkedlistflattened.png" style="height: 80px; width: 1100px;" />
26+
<img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20028.%20%E5%B1%95%E5%B9%B3%E5%A4%9A%E7%BA%A7%E5%8F%8C%E5%90%91%E9%93%BE%E8%A1%A8/images/multilevellinkedlistflattened.png" style="height: 80px; width: 1100px;" />
2727
</pre>
2828

2929
<p><strong>示例 2：</strong></p>

‎lcof2/剑指 Offer II 029. 排序的循环链表/README.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -16,15 +16,15 @@
1616

1717
<p><strong>示例 1：</strong></p>
1818

19-
<p><img alt="" src="https://assets.leetcode.com/uploads/2019/01/19/example_1_before_65p.jpg" style="height: 149px; width: 250px;" /><br />
19+
<p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20029.%20%E6%8E%92%E5%BA%8F%E7%9A%84%E5%BE%AA%E7%8E%AF%E9%93%BE%E8%A1%A8/images/example_1_before_65p.jpg" style="height: 149px; width: 250px;" /><br />
2020
&nbsp;</p>
2121

2222
<pre>
2323
<strong>输入：</strong>head = [3,4,1], insertVal = 2
2424
<strong>输出：</strong>[3,4,1,2]
2525
<strong>解释：</strong>在上图中，有一个包含三个元素的循环有序列表，你获得值为 3 的节点的指针，我们需要向表中插入元素 2 。新插入的节点应该在 1 和 3 之间，插入之后，整个列表如上图所示，最后返回节点 3 。
2626

27-
<img alt="" src="https://assets.leetcode.com/uploads/2019/01/19/example_1_after_65p.jpg" style="height: 149px; width: 250px;" />
27+
<img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20029.%20%E6%8E%92%E5%BA%8F%E7%9A%84%E5%BE%AA%E7%8E%AF%E9%93%BE%E8%A1%A8/images/example_1_after_65p.jpg" style="height: 149px; width: 250px;" />
2828
</pre>
2929

3030
<p><strong>示例 2：</strong></p>

‎lcof2/剑指 Offer II 039. 直方图最大矩形面积/README.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@
1212

1313
<p><strong>示例 1:</strong></p>
1414

15-
<p><img src="https://assets.leetcode.com/uploads/2021/01/04/histogram.jpg" /></p>
15+
<p><img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20039.%20%E7%9B%B4%E6%96%B9%E5%9B%BE%E6%9C%80%E5%A4%A7%E7%9F%A9%E5%BD%A2%E9%9D%A2%E7%A7%AF/images/histogram.jpg" /></p>
1616

1717
<pre>
1818
<strong>输入：</strong>heights = [2,1,5,6,2,3]
@@ -22,7 +22,7 @@
2222

2323
<p><strong>示例 2：</strong></p>
2424

25-
<p><img src="https://assets.leetcode.com/uploads/2021/01/04/histogram-1.jpg" /></p>
25+
<p><img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20039.%20%E7%9B%B4%E6%96%B9%E5%9B%BE%E6%9C%80%E5%A4%A7%E7%9F%A9%E5%BD%A2%E9%9D%A2%E7%A7%AF/images/histogram-1.jpg" /></p>
2626

2727
<pre>
2828
<strong>输入：</strong> heights = [2,4]

‎lcof2/剑指 Offer II 040. 矩阵中最大的矩形/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@
1212

1313
<p><strong>示例 1：</strong></p>
1414

15-
<p><img alt="" src="https://assets.leetcode.com/uploads/2020/09/14/maximal.jpg" style="width: 402px; height: 322px;" /></p>
15+
<p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20040.%20%E7%9F%A9%E9%98%B5%E4%B8%AD%E6%9C%80%E5%A4%A7%E7%9A%84%E7%9F%A9%E5%BD%A2/images/maximal.jpg" style="width: 402px; height: 322px;" /></p>
1616

1717
<pre>
1818
<strong>输入：</strong>matrix = ["10100","10111","11111","10010"]

‎lcof2/剑指 Offer II 045. 二叉树最底层最左边的值/README.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@
1212

1313
<p><strong>示例 1:</strong></p>
1414

15-
<p><img src="https://assets.leetcode.com/uploads/2020/12/14/tree1.jpg" style="width: 182px; " /></p>
15+
<p><img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20045.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E6%9C%80%E5%BA%95%E5%B1%82%E6%9C%80%E5%B7%A6%E8%BE%B9%E7%9A%84%E5%80%BC/images/tree1.jpg" style="width: 182px; " /></p>
1616

1717
<pre>
1818
<strong>输入: </strong>root = [2,1,3]
@@ -21,7 +21,7 @@
2121

2222
<p><strong>示例 2: </strong></p>
2323

24-
<p><img src="https://assets.leetcode.com/uploads/2020/12/14/tree2.jpg" style="width: 242px; " /><strong> </strong></p>
24+
<p><img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20045.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E6%9C%80%E5%BA%95%E5%B1%82%E6%9C%80%E5%B7%A6%E8%BE%B9%E7%9A%84%E5%80%BC/images/tree2.jpg" style="width: 242px; " /><strong> </strong></p>
2525

2626
<pre>
2727
<strong>输入: </strong>[1,2,3,4,null,5,6,null,null,7]

‎lcof2/剑指 Offer II 046. 二叉树的右侧视图/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -10,7 +10,7 @@
1010

1111
<p><strong>示例 1:</strong></p>
1212

13-
<p><img src="https://assets.leetcode.com/uploads/2021/02/14/tree.jpg" style="width: 270px; " /></p>
13+
<p><img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20046.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%8F%B3%E4%BE%A7%E8%A7%86%E5%9B%BE/images/tree.jpg" style="width: 270px; " /></p>
1414

1515
<pre>
1616
<strong>输入:</strong>&nbsp;[1,2,3,null,5,null,4]

‎lcof2/剑指 Offer II 047. 二叉树剪枝/README.md

+3-3
Original file line numberDiff line numberDiff line change
@@ -19,7 +19,7 @@
1919
只有红色节点满足条件&ldquo;所有不包含 1 的子树&rdquo;。
2020
右图为返回的答案。
2121

22-
<img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/04/06/1028_2.png" style="width:450px" />
22+
<img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20047.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E5%89%AA%E6%9E%9D/images/1028_2.png" style="width:450px" />
2323
</pre>
2424

2525
<p><strong>示例 2:</strong></p>
@@ -29,7 +29,7 @@
2929
<strong>输出: </strong>[1,null,1,null,1]
3030
<strong>解释:</strong>
3131

32-
<img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/04/06/1028_1.png" style="width:450px" />
32+
<img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20047.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E5%89%AA%E6%9E%9D/images/1028_1.png" style="width:450px" />
3333
</pre>
3434

3535
<p><strong>示例 3:</strong></p>
@@ -39,7 +39,7 @@
3939
<strong>输出: </strong>[1,1,0,1,1,null,1]
4040
<strong>解释:</strong>
4141

42-
<img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/04/05/1028.png" style="width:450px" />
42+
<img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20047.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E5%89%AA%E6%9E%9D/images/1028.png" style="width:450px" />
4343
</pre>
4444

4545
<p>&nbsp;</p>

‎lcof2/剑指 Offer II 048. 序列化与反序列化二叉树/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@
1212

1313
<p><strong>示例 1：</strong></p>
1414

15-
<p><img alt="" src="https://assets.leetcode.com/uploads/2020/09/15/serdeser.jpg" style="width: 442px; height: 324px;" /></p>
15+
<p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20048.%20%E5%BA%8F%E5%88%97%E5%8C%96%E4%B8%8E%E5%8F%8D%E5%BA%8F%E5%88%97%E5%8C%96%E4%BA%8C%E5%8F%89%E6%A0%91/images/serdeser.jpg" style="width: 442px; height: 324px;" /></p>
1616

1717
<pre>
1818
<strong>输入：</strong>root = [1,2,3,null,null,4,5]

‎lcof2/剑指 Offer II 049. 从根节点到叶节点的路径数字之和/README.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -21,7 +21,7 @@
2121
<p>&nbsp;</p>
2222

2323
<p><strong>示例 1：</strong></p>
24-
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/num1tree.jpg" style="width: 212px; height: 182px;" />
24+
<img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20049.%20%E4%BB%8E%E6%A0%B9%E8%8A%82%E7%82%B9%E5%88%B0%E5%8F%B6%E8%8A%82%E7%82%B9%E7%9A%84%E8%B7%AF%E5%BE%84%E6%95%B0%E5%AD%97%E4%B9%8B%E5%92%8C/images/num1tree.jpg" style="width: 212px; height: 182px;" />
2525
<pre>
2626
<strong>输入：</strong>root = [1,2,3]
2727
<strong>输出：</strong>25
@@ -31,7 +31,7 @@
3131
因此，数字总和 = 12 + 13 = <code>25</code></pre>
3232

3333
<p><strong>示例 2：</strong></p>
34-
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/num2tree.jpg" style="width: 292px; height: 302px;" />
34+
<img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20049.%20%E4%BB%8E%E6%A0%B9%E8%8A%82%E7%82%B9%E5%88%B0%E5%8F%B6%E8%8A%82%E7%82%B9%E7%9A%84%E8%B7%AF%E5%BE%84%E6%95%B0%E5%AD%97%E4%B9%8B%E5%92%8C/images/num2tree.jpg" style="width: 292px; height: 302px;" />
3535
<pre>
3636
<strong>输入：</strong>root = [4,9,0,5,1]
3737
<strong>输出：</strong>1026

‎lcof2/剑指 Offer II 050. 向下的路径节点之和/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@
1212

1313
<p><strong>示例 1：</strong></p>
1414

15-
<p><img src="https://assets.leetcode.com/uploads/2021/04/09/pathsum3-1-tree.jpg" style="width: 452px; " /></p>
15+
<p><img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20050.%20%E5%90%91%E4%B8%8B%E7%9A%84%E8%B7%AF%E5%BE%84%E8%8A%82%E7%82%B9%E4%B9%8B%E5%92%8C/images/pathsum3-1-tree.jpg" style="width: 452px; " /></p>
1616

1717
<pre>
1818
<strong>输入：</strong>root = [10,5,-3,3,2,null,11,3,-2,null,1], targetSum = 8

‎lcof2/剑指 Offer II 051. 节点之和最大的路径/README.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -14,7 +14,7 @@
1414

1515
<p><strong>示例 1：</strong></p>
1616

17-
<p><img alt="" src="https://assets.leetcode.com/uploads/2020/10/13/exx1.jpg" style="width: 322px; height: 182px;" /></p>
17+
<p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20051.%20%E8%8A%82%E7%82%B9%E4%B9%8B%E5%92%8C%E6%9C%80%E5%A4%A7%E7%9A%84%E8%B7%AF%E5%BE%84/images/exx1.jpg" style="width: 322px; height: 182px;" /></p>
1818

1919
<pre>
2020
<strong>输入：</strong>root = [1,2,3]
@@ -23,7 +23,7 @@
2323

2424
<p><strong>示例 2：</strong></p>
2525

26-
<p><img alt="" src="https://assets.leetcode.com/uploads/2020/10/13/exx2.jpg" /></p>
26+
<p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20051.%20%E8%8A%82%E7%82%B9%E4%B9%8B%E5%92%8C%E6%9C%80%E5%A4%A7%E7%9A%84%E8%B7%AF%E5%BE%84/images/exx2.jpg" /></p>
2727

2828
<pre>
2929
<strong>输入：</strong>root = [-10,9,20,null,null,15,7]

‎lcof2/剑指 Offer II 052. 展平二叉搜索树/README.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -10,7 +10,7 @@
1010

1111
<p><strong>示例 1：</strong></p>
1212

13-
<p><img alt="" src="https://assets.leetcode.com/uploads/2020/11/17/ex1.jpg" style="width: 600px; height: 350px;" /></p>
13+
<p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20052.%20%E5%B1%95%E5%B9%B3%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91/images/ex1.jpg" style="width: 600px; height: 350px;" /></p>
1414

1515
<pre>
1616
<strong>输入：</strong>root = [5,3,6,2,4,null,8,1,null,null,null,7,9]
@@ -19,7 +19,7 @@
1919

2020
<p><strong>示例 2：</strong></p>
2121

22-
<p><img alt="" src="https://assets.leetcode.com/uploads/2020/11/17/ex2.jpg" style="width: 300px; height: 114px;" /></p>
22+
<p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/lcof2/%E5%89%91%E6%8C%87%20Offer%20II%20052.%20%E5%B1%95%E5%B9%B3%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91/images/ex2.jpg" style="width: 300px; height: 114px;" /></p>
2323

2424
<pre>
2525
<strong>输入：</strong>root = [5,1,7]

0 commit comments

Comments
 (0)