From 4254bec2855a500c2cfba74879c0930e7817b982 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E5=BC=A0=E5=BF=97=E6=99=A8?=
 <zhangzhichen@zhangzhichen.local>
Date: Mon, 25 Jul 2022 14:26:18 +0800
Subject: [PATCH] fix img link

---
 .../1.cpp/100.exercises/solution.md"                      | 6 +++---
 .../1.cpp/101.exercises/solution.md"                      | 4 ++--
 .../1.cpp/102.exercises/solution.md"                      | 2 +-
 .../1.cpp/103.exercises/solution.md"                      | 4 ++--
 .../1.cpp/104.exercises/solution.md"                      | 2 +-
 .../1.cpp/105.exercises/solution.md"                      | 2 +-
 .../1.cpp/110.exercises/solution.md"                      | 6 +++---
 .../1.cpp/111.exercises/solution.md"                      | 6 +++---
 .../1.cpp/114.exercises/solution.md"                      | 8 ++++----
 .../1.cpp/123.exercises/solution.md"                      | 2 +-
 .../1.cpp/126.exercises/solution.md"                      | 4 ++--
 .../1.cpp/134.exercises/solution.md"                      | 4 ++--
 .../1.cpp/135.exercises/solution.md"                      | 2 +-
 .../1.cpp/40.exercises/solution.md"                       | 2 +-
 .../1.cpp/78.exercises/solution.md"                       | 2 +-
 .../1.cpp/80.exercises/solution.md"                       | 2 +-
 .../1.cpp/82.exercises/solution.md"                       | 2 +-
 .../1.cpp/86.exercises/solution.md"                       | 2 +-
 .../2.java/29.exercises/solution.md"                      | 2 +-
 .../2.java/31.exercises/solution.md"                      | 2 +-
 .../2.java/33.exercises/solution.md"                      | 2 +-
 .../2.java/37.exercises/solution.md"                      | 2 +-
 .../2.java/51.exercises/solution.md"                      | 6 +++---
 .../2.java/52.exercises/solution.md"                      | 4 ++--
 .../2.java/53.exercises/solution.md"                      | 2 +-
 .../2.java/54.exercises/solution.md"                      | 4 ++--
 .../2.java/55.exercises/solution.md"                      | 2 +-
 .../2.java/56.exercises/solution.md"                      | 2 +-
 .../2.java/61.exercises/solution.md"                      | 6 +++---
 .../2.java/62.exercises/solution.md"                      | 6 +++---
 .../2.java/73.exercises/solution.md"                      | 2 +-
 .../2.java/76.exercises/solution.md"                      | 4 ++--
 .../2.java/84.exercises/solution.md"                      | 4 ++--
 .../2.java/85.exercises/solution.md"                      | 2 +-
 .../3.python/29.exercises/solution.md"                    | 2 +-
 .../3.python/31.exercises/solution.md"                    | 2 +-
 .../3.python/33.exercises/solution.md"                    | 2 +-
 .../3.python/37.exercises/solution.md"                    | 2 +-
 .../3.python/51.exercises/solution.md"                    | 6 +++---
 .../3.python/52.exercises/solution.md"                    | 4 ++--
 .../3.python/53.exercises/solution.md"                    | 2 +-
 .../3.python/54.exercises/solution.md"                    | 4 ++--
 .../3.python/55.exercises/solution.md"                    | 2 +-
 .../3.python/56.exercises/solution.md"                    | 2 +-
 .../3.python/61.exercises/solution.md"                    | 6 +++---
 .../3.python/62.exercises/solution.md"                    | 6 +++---
 .../3.python/65.exercises/solution.md"                    | 8 ++++----
 .../3.python/74.exercises/solution.md"                    | 2 +-
 .../3.python/77.exercises/solution.md"                    | 4 ++--
 .../3.python/85.exercises/solution.md"                    | 4 ++--
 .../1.cpp/100.exercises/solution.md"                      | 4 ++--
 .../1.cpp/101.exercises/solution.md"                      | 2 +-
 .../1.cpp/103.exercises/solution.md"                      | 6 +++---
 .../1.cpp/106.exercises/solution.md"                      | 6 +++---
 .../1.cpp/108.exercises/solution.md"                      | 6 +++---
 .../1.cpp/109.exercises/solution.md"                      | 4 ++--
 .../1.cpp/111.exercises/solution.md"                      | 2 +-
 .../1.cpp/112.exercises/solution.md"                      | 4 ++--
 .../1.cpp/120.exercises/solution.md"                      | 2 +-
 .../1.cpp/125.exercises/solution.md"                      | 2 +-
 .../1.cpp/29.exercises/solution.md"                       | 2 +-
 .../1.cpp/31.exercises/solution.md"                       | 2 +-
 .../1.cpp/32.exercises/solution.md"                       | 2 +-
 .../1.cpp/33.exercises/solution.md"                       | 2 +-
 .../1.cpp/35.exercises/solution.md"                       | 2 +-
 .../1.cpp/38.exercises/solution.md"                       | 2 +-
 .../1.cpp/39.exercises/solution.md"                       | 2 +-
 .../1.cpp/4.exercises/solution.md"                        | 2 +-
 .../1.cpp/42.exercises/solution.md"                       | 2 +-
 .../1.cpp/43.exercises/solution.md"                       | 2 +-
 .../1.cpp/49.exercises/solution.md"                       | 2 +-
 .../1.cpp/50.exercises/solution.md"                       | 2 +-
 .../1.cpp/56.exercises/solution.md"                       | 2 +-
 .../1.cpp/59.exercises/solution.md"                       | 2 +-
 .../1.cpp/62.exercises/solution.md"                       | 2 +-
 .../1.cpp/65.exercises/solution.md"                       | 2 +-
 .../1.cpp/66.exercises/solution.md"                       | 2 +-
 .../1.cpp/67.exercises/solution.md"                       | 2 +-
 .../1.cpp/72.exercises/solution.md"                       | 2 +-
 .../1.cpp/78.exercises/solution.md"                       | 2 +-
 .../1.cpp/79.exercises/solution.md"                       | 4 ++--
 .../1.cpp/80.exercises/solution.md"                       | 2 +-
 .../1.cpp/83.exercises/solution.md"                       | 2 +-
 .../1.cpp/84.exercises/solution.md"                       | 2 +-
 .../1.cpp/86.exercises/solution.md"                       | 6 +++---
 .../1.cpp/87.exercises/solution.md"                       | 2 +-
 .../1.cpp/90.exercises/solution.md"                       | 2 +-
 .../1.cpp/94.exercises/solution.md"                       | 4 ++--
 .../1.cpp/95.exercises/solution.md"                       | 2 +-
 .../1.cpp/96.exercises/solution.md"                       | 2 +-
 .../1.cpp/97.exercises/solution.md"                       | 2 +-
 .../2.java/10.exercises/solution.md"                      | 2 +-
 .../2.java/102.exercises/solution.md"                     | 2 +-
 .../2.java/12.exercises/solution.md"                      | 2 +-
 .../2.java/15.exercises/solution.md"                      | 2 +-
 .../2.java/16.exercises/solution.md"                      | 2 +-
 .../2.java/19.exercises/solution.md"                      | 2 +-
 .../2.java/20.exercises/solution.md"                      | 2 +-
 .../2.java/26.exercises/solution.md"                      | 2 +-
 .../2.java/27.exercises/solution.md"                      | 2 +-
 .../2.java/33.exercises/solution.md"                      | 2 +-
 .../2.java/36.exercises/solution.md"                      | 2 +-
 .../2.java/39.exercises/solution.md"                      | 2 +-
 .../2.java/42.exercises/solution.md"                      | 2 +-
 .../2.java/43.exercises/solution.md"                      | 2 +-
 .../2.java/44.exercises/solution.md"                      | 2 +-
 .../2.java/49.exercises/solution.md"                      | 2 +-
 .../2.java/55.exercises/solution.md"                      | 2 +-
 .../2.java/56.exercises/solution.md"                      | 4 ++--
 .../2.java/57.exercises/solution.md"                      | 2 +-
 .../2.java/6.exercises/solution.md"                       | 2 +-
 .../2.java/60.exercises/solution.md"                      | 2 +-
 .../2.java/61.exercises/solution.md"                      | 2 +-
 .../2.java/63.exercises/solution.md"                      | 6 +++---
 .../2.java/64.exercises/solution.md"                      | 2 +-
 .../2.java/67.exercises/solution.md"                      | 2 +-
 .../2.java/71.exercises/solution.md"                      | 4 ++--
 .../2.java/72.exercises/solution.md"                      | 2 +-
 .../2.java/73.exercises/solution.md"                      | 2 +-
 .../2.java/74.exercises/solution.md"                      | 2 +-
 .../2.java/77.exercises/solution.md"                      | 4 ++--
 .../2.java/78.exercises/solution.md"                      | 2 +-
 .../2.java/8.exercises/solution.md"                       | 2 +-
 .../2.java/80.exercises/solution.md"                      | 6 +++---
 .../2.java/83.exercises/solution.md"                      | 6 +++---
 .../2.java/85.exercises/solution.md"                      | 6 +++---
 .../2.java/86.exercises/solution.md"                      | 4 ++--
 .../2.java/88.exercises/solution.md"                      | 2 +-
 .../2.java/89.exercises/solution.md"                      | 4 ++--
 .../2.java/9.exercises/solution.md"                       | 2 +-
 .../2.java/97.exercises/solution.md"                      | 2 +-
 .../3.python/101.exercises/solution.md"                   | 2 +-
 .../3.python/11.exercises/solution.md"                    | 2 +-
 .../3.python/14.exercises/solution.md"                    | 2 +-
 .../3.python/15.exercises/solution.md"                    | 2 +-
 .../3.python/18.exercises/solution.md"                    | 2 +-
 .../3.python/19.exercises/solution.md"                    | 2 +-
 .../3.python/25.exercises/solution.md"                    | 2 +-
 .../3.python/26.exercises/solution.md"                    | 2 +-
 .../3.python/32.exercises/solution.md"                    | 2 +-
 .../3.python/35.exercises/solution.md"                    | 2 +-
 .../3.python/38.exercises/solution.md"                    | 2 +-
 .../3.python/41.exercises/solution.md"                    | 2 +-
 .../3.python/42.exercises/solution.md"                    | 2 +-
 .../3.python/43.exercises/solution.md"                    | 2 +-
 .../3.python/48.exercises/solution.md"                    | 2 +-
 .../3.python/5.exercises/solution.md"                     | 2 +-
 .../3.python/54.exercises/solution.md"                    | 2 +-
 .../3.python/55.exercises/solution.md"                    | 4 ++--
 .../3.python/56.exercises/solution.md"                    | 2 +-
 .../3.python/59.exercises/solution.md"                    | 2 +-
 .../3.python/60.exercises/solution.md"                    | 2 +-
 .../3.python/62.exercises/solution.md"                    | 6 +++---
 .../3.python/63.exercises/solution.md"                    | 2 +-
 .../3.python/66.exercises/solution.md"                    | 2 +-
 .../3.python/7.exercises/solution.md"                     | 2 +-
 .../3.python/70.exercises/solution.md"                    | 4 ++--
 .../3.python/71.exercises/solution.md"                    | 2 +-
 .../3.python/72.exercises/solution.md"                    | 2 +-
 .../3.python/73.exercises/solution.md"                    | 2 +-
 .../3.python/76.exercises/solution.md"                    | 4 ++--
 .../3.python/77.exercises/solution.md"                    | 2 +-
 .../3.python/79.exercises/solution.md"                    | 6 +++---
 .../3.python/8.exercises/solution.md"                     | 2 +-
 .../3.python/82.exercises/solution.md"                    | 6 +++---
 .../3.python/84.exercises/solution.md"                    | 6 +++---
 .../3.python/85.exercises/solution.md"                    | 4 ++--
 .../3.python/87.exercises/solution.md"                    | 2 +-
 .../3.python/88.exercises/solution.md"                    | 4 ++--
 .../3.python/9.exercises/solution.md"                     | 2 +-
 .../3.python/96.exercises/solution.md"                    | 2 +-
 .../1.cpp/21.exercises/solution.md"                       | 4 ++--
 .../1.cpp/22.exercises/solution.md"                       | 2 +-
 .../1.cpp/23.exercises/solution.md"                       | 2 +-
 .../1.cpp/25.exercises/solution.md"                       | 2 +-
 .../1.cpp/26.exercises/solution.md"                       | 2 +-
 .../1.cpp/30.exercises/solution.md"                       | 2 +-
 .../1.cpp/32.exercises/solution.md"                       | 2 +-
 .../1.cpp/43.exercises/solution.md"                       | 4 ++--
 .../1.cpp/49.exercises/solution.md"                       | 4 ++--
 .../1.cpp/54.exercises/solution.md"                       | 4 ++--
 .../1.cpp/56.exercises/solution.md"                       | 2 +-
 .../1.cpp/63.exercises/solution.md"                       | 2 +-
 .../1.cpp/69.exercises/solution.md"                       | 4 ++--
 .../1.cpp/71.exercises/solution.md"                       | 6 +++---
 .../1.cpp/75.exercises/solution.md"                       | 2 +-
 .../1.cpp/76.exercises/solution.md"                       | 8 ++++----
 .../2.java/1.exercises/solution.md"                       | 4 ++--
 .../2.java/10.exercises/solution.md"                      | 2 +-
 .../2.java/12.exercises/solution.md"                      | 2 +-
 .../2.java/2.exercises/solution.md"                       | 2 +-
 .../2.java/23.exercises/solution.md"                      | 4 ++--
 .../2.java/29.exercises/solution.md"                      | 4 ++--
 .../2.java/3.exercises/solution.md"                       | 2 +-
 .../2.java/34.exercises/solution.md"                      | 4 ++--
 .../2.java/36.exercises/solution.md"                      | 2 +-
 .../2.java/43.exercises/solution.md"                      | 2 +-
 .../2.java/49.exercises/solution.md"                      | 4 ++--
 .../2.java/5.exercises/solution.md"                       | 2 +-
 .../2.java/51.exercises/solution.md"                      | 6 +++---
 .../2.java/55.exercises/solution.md"                      | 2 +-
 .../2.java/57.exercises/solution.md"                      | 8 ++++----
 .../2.java/6.exercises/solution.md"                       | 2 +-
 .../3.python/11.exercises/solution.md"                    | 2 +-
 .../3.python/13.exercises/solution.md"                    | 2 +-
 .../3.python/2.exercises/solution.md"                     | 4 ++--
 .../3.python/24.exercises/solution.md"                    | 4 ++--
 .../3.python/3.exercises/solution.md"                     | 2 +-
 .../3.python/30.exercises/solution.md"                    | 4 ++--
 .../3.python/35.exercises/solution.md"                    | 4 ++--
 .../3.python/37.exercises/solution.md"                    | 2 +-
 .../3.python/4.exercises/solution.md"                     | 2 +-
 .../3.python/44.exercises/solution.md"                    | 2 +-
 .../3.python/50.exercises/solution.md"                    | 4 ++--
 .../3.python/52.exercises/solution.md"                    | 6 +++---
 .../3.python/56.exercises/solution.md"                    | 2 +-
 .../3.python/6.exercises/solution.md"                     | 2 +-
 .../3.python/7.exercises/solution.md"                     | 2 +-
 218 files changed, 320 insertions(+), 320 deletions(-)

diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/100.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/100.exercises/solution.md"
index e193cacbc..8b86d3942 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/100.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/100.exercises/solution.md"
@@ -7,16 +7,16 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/18/btree1.jpg" style="width: 302px; height: 222px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/2b9d04525f6f3c9ba0a80c31c023cd8c.jpeg" style="width: 302px; height: 222px;" />
 <pre>
 <strong>输入：</strong>nums = [-10,-3,0,5,9]
 <strong>输出：</strong>[0,-3,9,-10,null,5]
 <strong>解释：</strong>[0,-10,5,null,-3,null,9] 也将被视为正确答案：
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/18/btree2.jpg" style="width: 302px; height: 222px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/4d6d8b77285a113d8fceda89c1844413.jpeg" style="width: 302px; height: 222px;" />
 </pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/18/btree.jpg" style="width: 342px; height: 142px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/0d1057250137556d44f0867c7553c7ae.jpeg" style="width: 342px; height: 142px;" />
 <pre>
 <strong>输入：</strong>nums = [1,3]
 <strong>输出：</strong>[3,1]
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/101.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/101.exercises/solution.md"
index 56a72c715..a5dc50c0c 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/101.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/101.exercises/solution.md"
@@ -11,14 +11,14 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/10/06/balance_1.jpg" style="width: 342px; height: 221px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/341009251c7788edc838975732064bf1.jpeg" style="width: 342px; height: 221px;" />
 <pre>
 <strong>输入：</strong>root = [3,9,20,null,null,15,7]
 <strong>输出：</strong>true
 </pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/10/06/balance_2.jpg" style="width: 452px; height: 301px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/bce64ca4c0e80b345a5a286122112851.jpeg" style="width: 452px; height: 301px;" />
 <pre>
 <strong>输入：</strong>root = [1,2,2,3,3,null,null,4,4]
 <strong>输出：</strong>false
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/102.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/102.exercises/solution.md"
index 527bf9365..6c6f1954f 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/102.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/102.exercises/solution.md"
@@ -9,7 +9,7 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/10/12/ex_depth.jpg" style="width: 432px; height: 302px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/6d8500c55fe3ebe98dc781d7b62a3bbf.jpeg" style="width: 432px; height: 302px;" />
 <pre>
 <strong>输入：</strong>root = [3,9,20,null,null,15,7]
 <strong>输出：</strong>2
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/103.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/103.exercises/solution.md"
index b42acb06b..432be48a1 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/103.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/103.exercises/solution.md"
@@ -7,14 +7,14 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/01/18/pathsum1.jpg" style="width: 500px; height: 356px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/ef95371d9da7672aade4dc505260cc30.jpeg" style="width: 500px; height: 356px;" />
 <pre>
 <strong>输入：</strong>root = [5,4,8,11,null,13,4,7,2,null,null,null,1], targetSum = 22
 <strong>输出：</strong>true
 </pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/01/18/pathsum2.jpg" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/9bc801134935f549d425954a120f1cc3.jpeg" />
 <pre>
 <strong>输入：</strong>root = [1,2,3], targetSum = 5
 <strong>输出：</strong>false
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/104.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/104.exercises/solution.md"
index e9885e585..3e25eae36 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/104.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/104.exercises/solution.md"
@@ -4,7 +4,7 @@
 
 <p><small>在「杨辉三角」中，每个数是它左上方和右上方的数的和。</small></p>
 
-<p><img alt="" src="https://pic.leetcode-cn.com/1626927345-DZmfxB-PascalTriangleAnimated2.gif" /></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/53cb4e7f630b8a991ebd02133e79a9c8.gif" /></p>
 
 <p> </p>
 
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/105.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/105.exercises/solution.md"
index de78c7844..07b5d6cf5 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/105.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/105.exercises/solution.md"
@@ -4,7 +4,7 @@
 
 <p><small>在「杨辉三角」中，每个数是它左上方和右上方的数的和。</small></p>
 
-<p><img alt="" src="https://pic.leetcode-cn.com/1626927345-DZmfxB-PascalTriangleAnimated2.gif" /></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/53cb4e7f630b8a991ebd02133e79a9c8.gif" /></p>
 
 <p> </p>
 
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/110.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/110.exercises/solution.md"
index 6d587b1cc..5c75ea21d 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/110.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/110.exercises/solution.md"
@@ -16,7 +16,7 @@
 
 <p><strong>示例 1：</strong></p>
 
-<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/12/07/circularlinkedlist.png" style="height: 97px; width: 300px;"></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/4a18acda10c1606aa5d1132b9de26d61.png" style="height: 97px; width: 300px;"></p>
 
 <pre><strong>输入：</strong>head = [3,2,0,-4], pos = 1
 <strong>输出：</strong>true
@@ -25,7 +25,7 @@
 
 <p><strong>示例&nbsp;2：</strong></p>
 
-<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>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/1a6fcfc68d7340c39151075f7fa53150.png" style="height: 74px; width: 141px;"></p>
 
 <pre><strong>输入：</strong>head = [1,2], pos = 0
 <strong>输出：</strong>true
@@ -34,7 +34,7 @@
 
 <p><strong>示例 3：</strong></p>
 
-<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>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/3039274e08a9385ea77b20a81060ed40.png" style="height: 45px; width: 45px;"></p>
 
 <pre><strong>输入：</strong>head = [1], pos = -1
 <strong>输出：</strong>false
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/111.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/111.exercises/solution.md"
index 4b9548af0..a40978adf 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/111.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/111.exercises/solution.md"
@@ -5,7 +5,7 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/09/15/inorder_1.jpg" style="width: 202px; height: 324px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/93c03b302d4108b3debe3c473af634ea.jpeg" style="width: 202px; height: 324px;" />
 <pre>
 <strong>输入：</strong>root = [1,null,2,3]
 <strong>输出：</strong>[1,2,3]
@@ -26,14 +26,14 @@
 </pre>
 
 <p><strong>示例 4：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/09/15/inorder_5.jpg" style="width: 202px; height: 202px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/428ab6a3e4c104cf4b41ad1a1a0a6f24.jpeg" style="width: 202px; height: 202px;" />
 <pre>
 <strong>输入：</strong>root = [1,2]
 <strong>输出：</strong>[1,2]
 </pre>
 
 <p><strong>示例 5：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/09/15/inorder_4.jpg" style="width: 202px; height: 202px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/67437fd84487294f797443df319c90e9.jpeg" style="width: 202px; height: 202px;" />
 <pre>
 <strong>输入：</strong>root = [1,null,2]
 <strong>输出：</strong>[1,2]
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/114.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/114.exercises/solution.md"
index 818e6a2e2..a6f5d8dbe 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/114.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/114.exercises/solution.md"
@@ -4,7 +4,7 @@
 
 <p>图示两个链表在节点 <code>c1</code> 开始相交<strong>：</strong></p>
 
-<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>
+<p><a href="https://img-service.csdnimg.cn/img_convert/4083c2324afbdd75cf739822d75aa194.png" target="_blank"><img alt="" src="https://img-service.csdnimg.cn/img_convert/4083c2324afbdd75cf739822d75aa194.png" style="height: 130px; width: 400px;" /></a></p>
 
 <p>题目数据 <strong>保证</strong> 整个链式结构中不存在环。</p>
 
@@ -14,7 +14,7 @@
 
 <p><strong>示例 1：</strong></p>
 
-<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>
+<p><a href="https://assets.leetcode.com/uploads/2018/12/13/160_example_1.png" target="_blank"><img alt="" src="https://img-service.csdnimg.cn/img_convert/ae6d8589871f13c05f80d247fc7f842e.png" style="height: 130px; width: 400px;" /></a></p>
 
 <pre>
 <strong>输入：</strong>intersectVal = 8, listA = [4,1,8,4,5], listB = [5,0,1,8,4,5], skipA = 2, skipB = 3
@@ -26,7 +26,7 @@
 
 <p><strong>示例 2：</strong></p>
 
-<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>
+<p><a href="https://assets.leetcode.com/uploads/2018/12/13/160_example_2.png" target="_blank"><img alt="" src="https://img-service.csdnimg.cn/img_convert/6bba6ee050d87974cf8d47c34f7d454d.png" style="height: 136px; width: 350px;" /></a></p>
 
 <pre>
 <strong>输入：</strong>intersectVal = 2, listA = [0,9,1,2,4], listB = [3,2,4], skipA = 3, skipB = 1
@@ -38,7 +38,7 @@
 
 <p><strong>示例 3：</strong></p>
 
-<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>
+<p><a href="https://assets.leetcode.com/uploads/2018/12/13/160_example_3.png" target="_blank"><img alt="" src="https://img-service.csdnimg.cn/img_convert/0dede36b1b22b3304429b96d722cc282.png" style="height: 126px; width: 200px;" /></a></p>
 
 <pre>
 <strong>输入：</strong>intersectVal = 0, listA = [2,6,4], listB = [1,5], skipA = 3, skipB = 2
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/123.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/123.exercises/solution.md"
index 4b34eddad..6c8281396 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/123.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/123.exercises/solution.md"
@@ -4,7 +4,7 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/03/06/removelinked-list.jpg" style="width: 500px; height: 142px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/77a1c3b8a1c4066a5773b6eb8738e857.jpeg" style="width: 500px; height: 142px;" />
 <pre>
 <strong>输入：</strong>head = [1,2,6,3,4,5,6], val = 6
 <strong>输出：</strong>[1,2,3,4,5]
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/126.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/126.exercises/solution.md"
index 9fd32f3f9..9ff699cb7 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/126.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/126.exercises/solution.md"
@@ -6,14 +6,14 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/rev1ex1.jpg" style="width: 542px; height: 222px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/1479f99ec2d8583971cc3dfb0c59e0cb.jpeg" style="width: 542px; height: 222px;" />
 <pre>
 <strong>输入：</strong>head = [1,2,3,4,5]
 <strong>输出：</strong>[5,4,3,2,1]
 </pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/rev1ex2.jpg" style="width: 182px; height: 222px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/1b87f6d74f7125930f57958e210e996b.jpeg" style="width: 182px; height: 222px;" />
 <pre>
 <strong>输入：</strong>head = [1,2]
 <strong>输出：</strong>[2,1]
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/134.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/134.exercises/solution.md"
index 2bd533e93..7bdb8a86c 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/134.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/134.exercises/solution.md"
@@ -5,14 +5,14 @@
 <p>&nbsp;</p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/03/03/pal1linked-list.jpg" style="width: 422px; height: 62px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/70b052810fbc7389fc6c77e5f8a7f388.jpeg" style="width: 422px; height: 62px;" />
 <pre>
 <strong>输入：</strong>head = [1,2,2,1]
 <strong>输出：</strong>true
 </pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/03/03/pal2linked-list.jpg" style="width: 182px; height: 62px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/2ecd174396cb07fbc62c7c4f0a851623.jpeg" style="width: 182px; height: 62px;" />
 <pre>
 <strong>输入：</strong>head = [1,2]
 <strong>输出：</strong>false
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/135.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/135.exercises/solution.md"
index 7ddce001c..307e4c19b 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/135.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/135.exercises/solution.md"
@@ -6,7 +6,7 @@
 
 <p>例如，给定如下二叉搜索树:&nbsp; root =&nbsp;[6,2,8,0,4,7,9,null,null,3,5]</p>
 
-<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/12/14/binarysearchtree_improved.png" style="height: 190px; width: 200px;"></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/f6e46ace5976ecb7788e718bdedf3e62.png" style="height: 190px; width: 200px;"></p>
 
 <p>&nbsp;</p>
 
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/40.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/40.exercises/solution.md"
index b61b818cb..911b10b65 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/40.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/40.exercises/solution.md"
@@ -1,7 +1,7 @@
 # 整数分解
 
 <p>输入一个整数&#xff0c;将其按7进制位分解为各乘式的累加和&#xff08;下图为输出结果&#xff09;</p>
-<p style="text-align:center"><img alt="" src="https://img-ask.csdnimg.cn/upload/1623209867965.jpg" />
+<p style="text-align:center"><img alt="" src="https://img-service.csdnimg.cn/img_convert/ad286bae0e15e84eb1781544d170ee7d.jpeg" />
  </p>
 
 ## template
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/78.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/78.exercises/solution.md"
index 542a7df22..bcf8cf054 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/78.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/78.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 合并两个有序链表
 
-<p>将两个升序链表合并为一个新的 <strong>升序</strong> 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。 </p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0021.Merge%20Two%20Sorted%20Lists/images/merge_ex1.jpg" style="width: 662px; height: 302px;" /><pre><strong>输入：</strong>l1 = [1,2,4], l2 = [1,3,4]<strong><br />输出：</strong>[1,1,2,3,4,4]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>l1 = [], l2 = []<strong><br />输出：</strong>[]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>l1 = [], l2 = [0]<strong><br />输出：</strong>[0]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>两个链表的节点数目范围是 <code>[0, 50]</code></li>	<li><code>-100 <= Node.val <= 100</code></li>	<li><code>l1</code> 和 <code>l2</code> 均按 <strong>非递减顺序</strong> 排列</li></ul>
+<p>将两个升序链表合并为一个新的 <strong>升序</strong> 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。 </p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/4c4b9ef8c8206165cf198a972bcd6088.jpeg" style="width: 662px; height: 302px;" /><pre><strong>输入：</strong>l1 = [1,2,4], l2 = [1,3,4]<strong><br />输出：</strong>[1,1,2,3,4,4]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>l1 = [], l2 = []<strong><br />输出：</strong>[]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>l1 = [], l2 = [0]<strong><br />输出：</strong>[0]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>两个链表的节点数目范围是 <code>[0, 50]</code></li>	<li><code>-100 <= Node.val <= 100</code></li>	<li><code>l1</code> 和 <code>l2</code> 均按 <strong>非递减顺序</strong> 排列</li></ul>
 
 ## template
 
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/80.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/80.exercises/solution.md"
index 43aa3a125..16655524e 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/80.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/80.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 删除排序链表中的重复元素
 
-<p>存在一个按升序排列的链表，给你这个链表的头节点 <code>head</code> ，请你删除所有重复的元素，使每个元素 <strong>只出现一次</strong> 。</p><p>返回同样按升序排列的结果链表。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0083.Remove%20Duplicates%20from%20Sorted%20List/images/list1.jpg" style="width: 302px; height: 242px;" /><pre><strong>输入：</strong>head = [1,1,2]<strong><br />输出：</strong>[1,2]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0083.Remove%20Duplicates%20from%20Sorted%20List/images/list2.jpg" style="width: 542px; height: 222px;" /><pre><strong>输入：</strong>head = [1,1,2,3,3]<strong><br />输出：</strong>[1,2,3]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点数目在范围 <code>[0, 300]</code> 内</li>	<li><code>-100 <= Node.val <= 100</code></li>	<li>题目数据保证链表已经按升序排列</li></ul>
+<p>存在一个按升序排列的链表，给你这个链表的头节点 <code>head</code> ，请你删除所有重复的元素，使每个元素 <strong>只出现一次</strong> 。</p><p>返回同样按升序排列的结果链表。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/b6eba8ba59536dfb80d2f593a68a3f5f.jpeg" style="width: 302px; height: 242px;" /><pre><strong>输入：</strong>head = [1,1,2]<strong><br />输出：</strong>[1,2]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/0141f292aa8d31b92eab3049dc01b485.jpeg" style="width: 542px; height: 222px;" /><pre><strong>输入：</strong>head = [1,1,2,3,3]<strong><br />输出：</strong>[1,2,3]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点数目在范围 <code>[0, 300]</code> 内</li>	<li><code>-100 <= Node.val <= 100</code></li>	<li>题目数据保证链表已经按升序排列</li></ul>
 
 ## template
 
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/82.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/82.exercises/solution.md"
index 93bbad570..c16b5bc08 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/82.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/82.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 相同的树
 
-<p>给你两棵二叉树的根节点 <code>p</code> 和 <code>q</code> ，编写一个函数来检验这两棵树是否相同。</p><p>如果两个树在结构上相同，并且节点具有相同的值，则认为它们是相同的。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0100.Same%20Tree/images/ex1.jpg" style="width: 622px; height: 182px;" /><pre><strong>输入：</strong>p = [1,2,3], q = [1,2,3]<strong><br />输出：</strong>true</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0100.Same%20Tree/images/ex2.jpg" style="width: 382px; height: 182px;" /><pre><strong>输入：</strong>p = [1,2], q = [1,null,2]<strong><br />输出：</strong>false</pre><p><strong>示例 3：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0100.Same%20Tree/images/ex3.jpg" style="width: 622px; height: 182px;" /><pre><strong>输入：</strong>p = [1,2,1], q = [1,1,2]<strong><br />输出：</strong>false</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>两棵树上的节点数目都在范围 <code>[0, 100]</code> 内</li>	<li><code>-10<sup>4</sup> <= Node.val <= 10<sup>4</sup></code></li></ul>
+<p>给你两棵二叉树的根节点 <code>p</code> 和 <code>q</code> ，编写一个函数来检验这两棵树是否相同。</p><p>如果两个树在结构上相同，并且节点具有相同的值，则认为它们是相同的。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/f57f91797d38f7989b2840df0af56f12.jpeg" style="width: 622px; height: 182px;" /><pre><strong>输入：</strong>p = [1,2,3], q = [1,2,3]<strong><br />输出：</strong>true</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/3cd39cd15154d94a0916631a1bb0af62.jpeg" style="width: 382px; height: 182px;" /><pre><strong>输入：</strong>p = [1,2], q = [1,null,2]<strong><br />输出：</strong>false</pre><p><strong>示例 3：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/ec8eb306b8b154439c9322477d9b13bf.jpeg" style="width: 622px; height: 182px;" /><pre><strong>输入：</strong>p = [1,2,1], q = [1,1,2]<strong><br />输出：</strong>false</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>两棵树上的节点数目都在范围 <code>[0, 100]</code> 内</li>	<li><code>-10<sup>4</sup> <= Node.val <= 10<sup>4</sup></code></li></ul>
 
 ## template
 
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/86.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/86.exercises/solution.md"
index ce43bfa04..9583e279a 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/86.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/86.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 二叉树的中序遍历
 
-<p>给定一个二叉树的根节点 <code>root</code> ，返回它的 <strong>中序</strong> 遍历。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0094.Binary%20Tree%20Inorder%20Traversal/images/inorder_1.jpg" style="width: 202px; height: 324px;" /><pre><strong>输入：</strong>root = [1,null,2,3]<strong><br />输出：</strong>[1,3,2]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>root = []<strong><br />输出：</strong>[]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>root = [1]<strong><br />输出：</strong>[1]</pre><p><strong>示例 4：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0094.Binary%20Tree%20Inorder%20Traversal/images/inorder_5.jpg" style="width: 202px; height: 202px;" /><pre><strong>输入：</strong>root = [1,2]<strong><br />输出：</strong>[2,1]</pre><p><strong>示例 5：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0094.Binary%20Tree%20Inorder%20Traversal/images/inorder_4.jpg" style="width: 202px; height: 202px;" /><pre><strong>输入：</strong>root = [1,null,2]<strong><br />输出：</strong>[1,2]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>树中节点数目在范围 <code>[0, 100]</code> 内</li>	<li><code>-100 <= Node.val <= 100</code></li></ul><p> </p><p><strong>进阶:</strong> 递归算法很简单，你可以通过迭代算法完成吗？</p>
+<p>给定一个二叉树的根节点 <code>root</code> ，返回它的 <strong>中序</strong> 遍历。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/7f372b0f54f87384cc6c732b3cddc585.jpeg" style="width: 202px; height: 324px;" /><pre><strong>输入：</strong>root = [1,null,2,3]<strong><br />输出：</strong>[1,3,2]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>root = []<strong><br />输出：</strong>[]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>root = [1]<strong><br />输出：</strong>[1]</pre><p><strong>示例 4：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/31457a9f9368167556ffe0b6327ebc98.jpeg" style="width: 202px; height: 202px;" /><pre><strong>输入：</strong>root = [1,2]<strong><br />输出：</strong>[2,1]</pre><p><strong>示例 5：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/5a5703522184390ad83f06fad6566364.jpeg" style="width: 202px; height: 202px;" /><pre><strong>输入：</strong>root = [1,null,2]<strong><br />输出：</strong>[1,2]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>树中节点数目在范围 <code>[0, 100]</code> 内</li>	<li><code>-100 <= Node.val <= 100</code></li></ul><p> </p><p><strong>进阶:</strong> 递归算法很简单，你可以通过迭代算法完成吗？</p>
 
 ## template
 
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/29.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/2.java/29.exercises/solution.md"
index 6211b94be..da965ea4b 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/29.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/29.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 合并两个有序链表
 
-<p>将两个升序链表合并为一个新的 <strong>升序</strong> 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。 </p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0021.Merge%20Two%20Sorted%20Lists/images/merge_ex1.jpg" style="width: 662px; height: 302px;" /><pre><strong>输入：</strong>l1 = [1,2,4], l2 = [1,3,4]<strong><br />输出：</strong>[1,1,2,3,4,4]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>l1 = [], l2 = []<strong><br />输出：</strong>[]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>l1 = [], l2 = [0]<strong><br />输出：</strong>[0]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>两个链表的节点数目范围是 <code>[0, 50]</code></li>	<li><code>-100 <= Node.val <= 100</code></li>	<li><code>l1</code> 和 <code>l2</code> 均按 <strong>非递减顺序</strong> 排列</li></ul>
+<p>将两个升序链表合并为一个新的 <strong>升序</strong> 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。 </p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/4c4b9ef8c8206165cf198a972bcd6088.jpeg" style="width: 662px; height: 302px;" /><pre><strong>输入：</strong>l1 = [1,2,4], l2 = [1,3,4]<strong><br />输出：</strong>[1,1,2,3,4,4]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>l1 = [], l2 = []<strong><br />输出：</strong>[]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>l1 = [], l2 = [0]<strong><br />输出：</strong>[0]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>两个链表的节点数目范围是 <code>[0, 50]</code></li>	<li><code>-100 <= Node.val <= 100</code></li>	<li><code>l1</code> 和 <code>l2</code> 均按 <strong>非递减顺序</strong> 排列</li></ul>
 
 ## template
 
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/31.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/2.java/31.exercises/solution.md"
index 9a8668d4e..3e389db23 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/31.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/31.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 删除排序链表中的重复元素
 
-<p>存在一个按升序排列的链表，给你这个链表的头节点 <code>head</code> ，请你删除所有重复的元素，使每个元素 <strong>只出现一次</strong> 。</p><p>返回同样按升序排列的结果链表。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0083.Remove%20Duplicates%20from%20Sorted%20List/images/list1.jpg" style="width: 302px; height: 242px;" /><pre><strong>输入：</strong>head = [1,1,2]<strong><br />输出：</strong>[1,2]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0083.Remove%20Duplicates%20from%20Sorted%20List/images/list2.jpg" style="width: 542px; height: 222px;" /><pre><strong>输入：</strong>head = [1,1,2,3,3]<strong><br />输出：</strong>[1,2,3]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点数目在范围 <code>[0, 300]</code> 内</li>	<li><code>-100 <= Node.val <= 100</code></li>	<li>题目数据保证链表已经按升序排列</li></ul>
+<p>存在一个按升序排列的链表，给你这个链表的头节点 <code>head</code> ，请你删除所有重复的元素，使每个元素 <strong>只出现一次</strong> 。</p><p>返回同样按升序排列的结果链表。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/b6eba8ba59536dfb80d2f593a68a3f5f.jpeg" style="width: 302px; height: 242px;" /><pre><strong>输入：</strong>head = [1,1,2]<strong><br />输出：</strong>[1,2]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/0141f292aa8d31b92eab3049dc01b485.jpeg" style="width: 542px; height: 222px;" /><pre><strong>输入：</strong>head = [1,1,2,3,3]<strong><br />输出：</strong>[1,2,3]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点数目在范围 <code>[0, 300]</code> 内</li>	<li><code>-100 <= Node.val <= 100</code></li>	<li>题目数据保证链表已经按升序排列</li></ul>
 
 ## template
 
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/33.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/2.java/33.exercises/solution.md"
index 17db44cbe..e26becbd6 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/33.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/33.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 相同的树
 
-<p>给你两棵二叉树的根节点 <code>p</code> 和 <code>q</code> ，编写一个函数来检验这两棵树是否相同。</p><p>如果两个树在结构上相同，并且节点具有相同的值，则认为它们是相同的。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0100.Same%20Tree/images/ex1.jpg" style="width: 622px; height: 182px;" /><pre><strong>输入：</strong>p = [1,2,3], q = [1,2,3]<strong><br />输出：</strong>true</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0100.Same%20Tree/images/ex2.jpg" style="width: 382px; height: 182px;" /><pre><strong>输入：</strong>p = [1,2], q = [1,null,2]<strong><br />输出：</strong>false</pre><p><strong>示例 3：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0100.Same%20Tree/images/ex3.jpg" style="width: 622px; height: 182px;" /><pre><strong>输入：</strong>p = [1,2,1], q = [1,1,2]<strong><br />输出：</strong>false</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>两棵树上的节点数目都在范围 <code>[0, 100]</code> 内</li>	<li><code>-10<sup>4</sup> <= Node.val <= 10<sup>4</sup></code></li></ul>
+<p>给你两棵二叉树的根节点 <code>p</code> 和 <code>q</code> ，编写一个函数来检验这两棵树是否相同。</p><p>如果两个树在结构上相同，并且节点具有相同的值，则认为它们是相同的。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/f57f91797d38f7989b2840df0af56f12.jpeg" style="width: 622px; height: 182px;" /><pre><strong>输入：</strong>p = [1,2,3], q = [1,2,3]<strong><br />输出：</strong>true</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/3cd39cd15154d94a0916631a1bb0af62.jpeg" style="width: 382px; height: 182px;" /><pre><strong>输入：</strong>p = [1,2], q = [1,null,2]<strong><br />输出：</strong>false</pre><p><strong>示例 3：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/ec8eb306b8b154439c9322477d9b13bf.jpeg" style="width: 622px; height: 182px;" /><pre><strong>输入：</strong>p = [1,2,1], q = [1,1,2]<strong><br />输出：</strong>false</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>两棵树上的节点数目都在范围 <code>[0, 100]</code> 内</li>	<li><code>-10<sup>4</sup> <= Node.val <= 10<sup>4</sup></code></li></ul>
 
 ## template
 
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/37.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/2.java/37.exercises/solution.md"
index f153b13a7..b65eb6a82 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/37.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/37.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 二叉树的中序遍历
 
-<p>给定一个二叉树的根节点 <code>root</code> ，返回它的 <strong>中序</strong> 遍历。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0094.Binary%20Tree%20Inorder%20Traversal/images/inorder_1.jpg" style="width: 202px; height: 324px;" /><pre><strong>输入：</strong>root = [1,null,2,3]<strong><br />输出：</strong>[1,3,2]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>root = []<strong><br />输出：</strong>[]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>root = [1]<strong><br />输出：</strong>[1]</pre><p><strong>示例 4：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0094.Binary%20Tree%20Inorder%20Traversal/images/inorder_5.jpg" style="width: 202px; height: 202px;" /><pre><strong>输入：</strong>root = [1,2]<strong><br />输出：</strong>[2,1]</pre><p><strong>示例 5：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0094.Binary%20Tree%20Inorder%20Traversal/images/inorder_4.jpg" style="width: 202px; height: 202px;" /><pre><strong>输入：</strong>root = [1,null,2]<strong><br />输出：</strong>[1,2]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>树中节点数目在范围 <code>[0, 100]</code> 内</li>	<li><code>-100 <= Node.val <= 100</code></li></ul><p> </p><p><strong>进阶:</strong> 递归算法很简单，你可以通过迭代算法完成吗？</p>
+<p>给定一个二叉树的根节点 <code>root</code> ，返回它的 <strong>中序</strong> 遍历。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/7f372b0f54f87384cc6c732b3cddc585.jpeg" style="width: 202px; height: 324px;" /><pre><strong>输入：</strong>root = [1,null,2,3]<strong><br />输出：</strong>[1,3,2]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>root = []<strong><br />输出：</strong>[]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>root = [1]<strong><br />输出：</strong>[1]</pre><p><strong>示例 4：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/31457a9f9368167556ffe0b6327ebc98.jpeg" style="width: 202px; height: 202px;" /><pre><strong>输入：</strong>root = [1,2]<strong><br />输出：</strong>[2,1]</pre><p><strong>示例 5：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/5a5703522184390ad83f06fad6566364.jpeg" style="width: 202px; height: 202px;" /><pre><strong>输入：</strong>root = [1,null,2]<strong><br />输出：</strong>[1,2]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>树中节点数目在范围 <code>[0, 100]</code> 内</li>	<li><code>-100 <= Node.val <= 100</code></li></ul><p> </p><p><strong>进阶:</strong> 递归算法很简单，你可以通过迭代算法完成吗？</p>
 
 ## template
 
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/51.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/2.java/51.exercises/solution.md"
index 9656e8555..e88ce2d54 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/51.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/51.exercises/solution.md"
@@ -7,16 +7,16 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/18/btree1.jpg" style="width: 302px; height: 222px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/2b9d04525f6f3c9ba0a80c31c023cd8c.jpeg" style="width: 302px; height: 222px;" />
 <pre>
 <strong>输入：</strong>nums = [-10,-3,0,5,9]
 <strong>输出：</strong>[0,-3,9,-10,null,5]
 <strong>解释：</strong>[0,-10,5,null,-3,null,9] 也将被视为正确答案：
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/18/btree2.jpg" style="width: 302px; height: 222px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/4d6d8b77285a113d8fceda89c1844413.jpeg" style="width: 302px; height: 222px;" />
 </pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/18/btree.jpg" style="width: 342px; height: 142px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/0d1057250137556d44f0867c7553c7ae.jpeg" style="width: 342px; height: 142px;" />
 <pre>
 <strong>输入：</strong>nums = [1,3]
 <strong>输出：</strong>[3,1]
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/52.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/2.java/52.exercises/solution.md"
index ceca68b56..520866c8b 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/52.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/52.exercises/solution.md"
@@ -11,14 +11,14 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/10/06/balance_1.jpg" style="width: 342px; height: 221px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/341009251c7788edc838975732064bf1.jpeg" style="width: 342px; height: 221px;" />
 <pre>
 <strong>输入：</strong>root = [3,9,20,null,null,15,7]
 <strong>输出：</strong>true
 </pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/10/06/balance_2.jpg" style="width: 452px; height: 301px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/bce64ca4c0e80b345a5a286122112851.jpeg" style="width: 452px; height: 301px;" />
 <pre>
 <strong>输入：</strong>root = [1,2,2,3,3,null,null,4,4]
 <strong>输出：</strong>false
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/53.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/2.java/53.exercises/solution.md"
index 168561774..9e3629b4e 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/53.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/53.exercises/solution.md"
@@ -9,7 +9,7 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/10/12/ex_depth.jpg" style="width: 432px; height: 302px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/6d8500c55fe3ebe98dc781d7b62a3bbf.jpeg" style="width: 432px; height: 302px;" />
 <pre>
 <strong>输入：</strong>root = [3,9,20,null,null,15,7]
 <strong>输出：</strong>2
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/54.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/2.java/54.exercises/solution.md"
index 91a7a5c08..43b7a1b7c 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/54.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/54.exercises/solution.md"
@@ -7,14 +7,14 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/01/18/pathsum1.jpg" style="width: 500px; height: 356px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/ef95371d9da7672aade4dc505260cc30.jpeg" style="width: 500px; height: 356px;" />
 <pre>
 <strong>输入：</strong>root = [5,4,8,11,null,13,4,7,2,null,null,null,1], targetSum = 22
 <strong>输出：</strong>true
 </pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/01/18/pathsum2.jpg" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/9bc801134935f549d425954a120f1cc3.jpeg" />
 <pre>
 <strong>输入：</strong>root = [1,2,3], targetSum = 5
 <strong>输出：</strong>false
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/55.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/2.java/55.exercises/solution.md"
index c032f3a5c..ea938a63f 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/55.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/55.exercises/solution.md"
@@ -4,7 +4,7 @@
 
 <p><small>在「杨辉三角」中，每个数是它左上方和右上方的数的和。</small></p>
 
-<p><img alt="" src="https://pic.leetcode-cn.com/1626927345-DZmfxB-PascalTriangleAnimated2.gif" /></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/53cb4e7f630b8a991ebd02133e79a9c8.gif" /></p>
 
 <p> </p>
 
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/56.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/2.java/56.exercises/solution.md"
index f7c1b9096..a7c45aa0b 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/56.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/56.exercises/solution.md"
@@ -4,7 +4,7 @@
 
 <p><small>在「杨辉三角」中，每个数是它左上方和右上方的数的和。</small></p>
 
-<p><img alt="" src="https://pic.leetcode-cn.com/1626927345-DZmfxB-PascalTriangleAnimated2.gif" /></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/53cb4e7f630b8a991ebd02133e79a9c8.gif" /></p>
 
 <p> </p>
 
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/61.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/2.java/61.exercises/solution.md"
index 04feeba29..3e2ce66ce 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/61.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/61.exercises/solution.md"
@@ -16,7 +16,7 @@
 
 <p><strong>示例 1：</strong></p>
 
-<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/12/07/circularlinkedlist.png" style="height: 97px; width: 300px;"></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/4a18acda10c1606aa5d1132b9de26d61.png" style="height: 97px; width: 300px;"></p>
 
 <pre><strong>输入：</strong>head = [3,2,0,-4], pos = 1
 <strong>输出：</strong>true
@@ -25,7 +25,7 @@
 
 <p><strong>示例&nbsp;2：</strong></p>
 
-<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>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/1a6fcfc68d7340c39151075f7fa53150.png" style="height: 74px; width: 141px;"></p>
 
 <pre><strong>输入：</strong>head = [1,2], pos = 0
 <strong>输出：</strong>true
@@ -34,7 +34,7 @@
 
 <p><strong>示例 3：</strong></p>
 
-<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>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/3039274e08a9385ea77b20a81060ed40.png" style="height: 45px; width: 45px;"></p>
 
 <pre><strong>输入：</strong>head = [1], pos = -1
 <strong>输出：</strong>false
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/62.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/2.java/62.exercises/solution.md"
index 80a37e8a7..5746bb9f5 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/62.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/62.exercises/solution.md"
@@ -5,7 +5,7 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/09/15/inorder_1.jpg" style="width: 202px; height: 324px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/93c03b302d4108b3debe3c473af634ea.jpeg" style="width: 202px; height: 324px;" />
 <pre>
 <strong>输入：</strong>root = [1,null,2,3]
 <strong>输出：</strong>[1,2,3]
@@ -26,14 +26,14 @@
 </pre>
 
 <p><strong>示例 4：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/09/15/inorder_5.jpg" style="width: 202px; height: 202px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/428ab6a3e4c104cf4b41ad1a1a0a6f24.jpeg" style="width: 202px; height: 202px;" />
 <pre>
 <strong>输入：</strong>root = [1,2]
 <strong>输出：</strong>[1,2]
 </pre>
 
 <p><strong>示例 5：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/09/15/inorder_4.jpg" style="width: 202px; height: 202px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/67437fd84487294f797443df319c90e9.jpeg" style="width: 202px; height: 202px;" />
 <pre>
 <strong>输入：</strong>root = [1,null,2]
 <strong>输出：</strong>[1,2]
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/73.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/2.java/73.exercises/solution.md"
index 1eff0ebcd..69e41a9a6 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/73.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/73.exercises/solution.md"
@@ -4,7 +4,7 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/03/06/removelinked-list.jpg" style="width: 500px; height: 142px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/77a1c3b8a1c4066a5773b6eb8738e857.jpeg" style="width: 500px; height: 142px;" />
 <pre>
 <strong>输入：</strong>head = [1,2,6,3,4,5,6], val = 6
 <strong>输出：</strong>[1,2,3,4,5]
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/76.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/2.java/76.exercises/solution.md"
index a3dd03ecd..71ae45436 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/76.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/76.exercises/solution.md"
@@ -6,14 +6,14 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/rev1ex1.jpg" style="width: 542px; height: 222px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/1479f99ec2d8583971cc3dfb0c59e0cb.jpeg" style="width: 542px; height: 222px;" />
 <pre>
 <strong>输入：</strong>head = [1,2,3,4,5]
 <strong>输出：</strong>[5,4,3,2,1]
 </pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/rev1ex2.jpg" style="width: 182px; height: 222px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/1b87f6d74f7125930f57958e210e996b.jpeg" style="width: 182px; height: 222px;" />
 <pre>
 <strong>输入：</strong>head = [1,2]
 <strong>输出：</strong>[2,1]
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/84.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/2.java/84.exercises/solution.md"
index 07965ad56..3038968a9 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/84.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/84.exercises/solution.md"
@@ -5,14 +5,14 @@
 <p>&nbsp;</p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/03/03/pal1linked-list.jpg" style="width: 422px; height: 62px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/70b052810fbc7389fc6c77e5f8a7f388.jpeg" style="width: 422px; height: 62px;" />
 <pre>
 <strong>输入：</strong>head = [1,2,2,1]
 <strong>输出：</strong>true
 </pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/03/03/pal2linked-list.jpg" style="width: 182px; height: 62px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/2ecd174396cb07fbc62c7c4f0a851623.jpeg" style="width: 182px; height: 62px;" />
 <pre>
 <strong>输入：</strong>head = [1,2]
 <strong>输出：</strong>false
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/85.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/2.java/85.exercises/solution.md"
index 9be2cb38c..f3a35f89e 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/85.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/85.exercises/solution.md"
@@ -6,7 +6,7 @@
 
 <p>例如，给定如下二叉搜索树:&nbsp; root =&nbsp;[6,2,8,0,4,7,9,null,null,3,5]</p>
 
-<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/12/14/binarysearchtree_improved.png" style="height: 190px; width: 200px;"></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/f6e46ace5976ecb7788e718bdedf3e62.png" style="height: 190px; width: 200px;"></p>
 
 <p>&nbsp;</p>
 
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/29.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/3.python/29.exercises/solution.md"
index 7db8a0deb..ee9e673a9 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/29.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/29.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 合并两个有序链表
 
-<p>将两个升序链表合并为一个新的 <strong>升序</strong> 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。 </p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0021.Merge%20Two%20Sorted%20Lists/images/merge_ex1.jpg" style="width: 662px; height: 302px;" /><pre><strong>输入：</strong>l1 = [1,2,4], l2 = [1,3,4]<strong><br />输出：</strong>[1,1,2,3,4,4]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>l1 = [], l2 = []<strong><br />输出：</strong>[]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>l1 = [], l2 = [0]<strong><br />输出：</strong>[0]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>两个链表的节点数目范围是 <code>[0, 50]</code></li>	<li><code>-100 <= Node.val <= 100</code></li>	<li><code>l1</code> 和 <code>l2</code> 均按 <strong>非递减顺序</strong> 排列</li></ul>
+<p>将两个升序链表合并为一个新的 <strong>升序</strong> 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。 </p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/4c4b9ef8c8206165cf198a972bcd6088.jpeg" style="width: 662px; height: 302px;" /><pre><strong>输入：</strong>l1 = [1,2,4], l2 = [1,3,4]<strong><br />输出：</strong>[1,1,2,3,4,4]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>l1 = [], l2 = []<strong><br />输出：</strong>[]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>l1 = [], l2 = [0]<strong><br />输出：</strong>[0]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>两个链表的节点数目范围是 <code>[0, 50]</code></li>	<li><code>-100 <= Node.val <= 100</code></li>	<li><code>l1</code> 和 <code>l2</code> 均按 <strong>非递减顺序</strong> 排列</li></ul>
 
 ## template
 
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/31.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/3.python/31.exercises/solution.md"
index f722fa51a..f0a83360c 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/31.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/31.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 删除排序链表中的重复元素
 
-<p>存在一个按升序排列的链表，给你这个链表的头节点 <code>head</code> ，请你删除所有重复的元素，使每个元素 <strong>只出现一次</strong> 。</p><p>返回同样按升序排列的结果链表。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0083.Remove%20Duplicates%20from%20Sorted%20List/images/list1.jpg" style="width: 302px; height: 242px;" /><pre><strong>输入：</strong>head = [1,1,2]<strong><br />输出：</strong>[1,2]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0083.Remove%20Duplicates%20from%20Sorted%20List/images/list2.jpg" style="width: 542px; height: 222px;" /><pre><strong>输入：</strong>head = [1,1,2,3,3]<strong><br />输出：</strong>[1,2,3]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点数目在范围 <code>[0, 300]</code> 内</li>	<li><code>-100 <= Node.val <= 100</code></li>	<li>题目数据保证链表已经按升序排列</li></ul>
+<p>存在一个按升序排列的链表，给你这个链表的头节点 <code>head</code> ，请你删除所有重复的元素，使每个元素 <strong>只出现一次</strong> 。</p><p>返回同样按升序排列的结果链表。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/b6eba8ba59536dfb80d2f593a68a3f5f.jpeg" style="width: 302px; height: 242px;" /><pre><strong>输入：</strong>head = [1,1,2]<strong><br />输出：</strong>[1,2]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/0141f292aa8d31b92eab3049dc01b485.jpeg" style="width: 542px; height: 222px;" /><pre><strong>输入：</strong>head = [1,1,2,3,3]<strong><br />输出：</strong>[1,2,3]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点数目在范围 <code>[0, 300]</code> 内</li>	<li><code>-100 <= Node.val <= 100</code></li>	<li>题目数据保证链表已经按升序排列</li></ul>
 
 ## template
 
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/33.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/3.python/33.exercises/solution.md"
index 78b7525a4..5d4bdecfd 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/33.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/33.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 相同的树
 
-<p>给你两棵二叉树的根节点 <code>p</code> 和 <code>q</code> ，编写一个函数来检验这两棵树是否相同。</p><p>如果两个树在结构上相同，并且节点具有相同的值，则认为它们是相同的。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0100.Same%20Tree/images/ex1.jpg" style="width: 622px; height: 182px;" /><pre><strong>输入：</strong>p = [1,2,3], q = [1,2,3]<strong><br />输出：</strong>true</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0100.Same%20Tree/images/ex2.jpg" style="width: 382px; height: 182px;" /><pre><strong>输入：</strong>p = [1,2], q = [1,null,2]<strong><br />输出：</strong>false</pre><p><strong>示例 3：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0100.Same%20Tree/images/ex3.jpg" style="width: 622px; height: 182px;" /><pre><strong>输入：</strong>p = [1,2,1], q = [1,1,2]<strong><br />输出：</strong>false</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>两棵树上的节点数目都在范围 <code>[0, 100]</code> 内</li>	<li><code>-10<sup>4</sup> <= Node.val <= 10<sup>4</sup></code></li></ul>
+<p>给你两棵二叉树的根节点 <code>p</code> 和 <code>q</code> ，编写一个函数来检验这两棵树是否相同。</p><p>如果两个树在结构上相同，并且节点具有相同的值，则认为它们是相同的。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/f57f91797d38f7989b2840df0af56f12.jpeg" style="width: 622px; height: 182px;" /><pre><strong>输入：</strong>p = [1,2,3], q = [1,2,3]<strong><br />输出：</strong>true</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/3cd39cd15154d94a0916631a1bb0af62.jpeg" style="width: 382px; height: 182px;" /><pre><strong>输入：</strong>p = [1,2], q = [1,null,2]<strong><br />输出：</strong>false</pre><p><strong>示例 3：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/ec8eb306b8b154439c9322477d9b13bf.jpeg" style="width: 622px; height: 182px;" /><pre><strong>输入：</strong>p = [1,2,1], q = [1,1,2]<strong><br />输出：</strong>false</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>两棵树上的节点数目都在范围 <code>[0, 100]</code> 内</li>	<li><code>-10<sup>4</sup> <= Node.val <= 10<sup>4</sup></code></li></ul>
 
 ## template
 
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/37.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/3.python/37.exercises/solution.md"
index a14cb25ea..05ffef2ad 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/37.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/37.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 二叉树的中序遍历
 
-<p>给定一个二叉树的根节点 <code>root</code> ，返回它的 <strong>中序</strong> 遍历。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0094.Binary%20Tree%20Inorder%20Traversal/images/inorder_1.jpg" style="width: 202px; height: 324px;" /><pre><strong>输入：</strong>root = [1,null,2,3]<strong><br />输出：</strong>[1,3,2]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>root = []<strong><br />输出：</strong>[]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>root = [1]<strong><br />输出：</strong>[1]</pre><p><strong>示例 4：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0094.Binary%20Tree%20Inorder%20Traversal/images/inorder_5.jpg" style="width: 202px; height: 202px;" /><pre><strong>输入：</strong>root = [1,2]<strong><br />输出：</strong>[2,1]</pre><p><strong>示例 5：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0094.Binary%20Tree%20Inorder%20Traversal/images/inorder_4.jpg" style="width: 202px; height: 202px;" /><pre><strong>输入：</strong>root = [1,null,2]<strong><br />输出：</strong>[1,2]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>树中节点数目在范围 <code>[0, 100]</code> 内</li>	<li><code>-100 <= Node.val <= 100</code></li></ul><p> </p><p><strong>进阶:</strong> 递归算法很简单，你可以通过迭代算法完成吗？</p>
+<p>给定一个二叉树的根节点 <code>root</code> ，返回它的 <strong>中序</strong> 遍历。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/7f372b0f54f87384cc6c732b3cddc585.jpeg" style="width: 202px; height: 324px;" /><pre><strong>输入：</strong>root = [1,null,2,3]<strong><br />输出：</strong>[1,3,2]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>root = []<strong><br />输出：</strong>[]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>root = [1]<strong><br />输出：</strong>[1]</pre><p><strong>示例 4：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/31457a9f9368167556ffe0b6327ebc98.jpeg" style="width: 202px; height: 202px;" /><pre><strong>输入：</strong>root = [1,2]<strong><br />输出：</strong>[2,1]</pre><p><strong>示例 5：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/5a5703522184390ad83f06fad6566364.jpeg" style="width: 202px; height: 202px;" /><pre><strong>输入：</strong>root = [1,null,2]<strong><br />输出：</strong>[1,2]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>树中节点数目在范围 <code>[0, 100]</code> 内</li>	<li><code>-100 <= Node.val <= 100</code></li></ul><p> </p><p><strong>进阶:</strong> 递归算法很简单，你可以通过迭代算法完成吗？</p>
 
 ## template
 
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/51.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/3.python/51.exercises/solution.md"
index ebc0d0fdd..e7ef38ce8 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/51.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/51.exercises/solution.md"
@@ -7,16 +7,16 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/18/btree1.jpg" style="width: 302px; height: 222px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/2b9d04525f6f3c9ba0a80c31c023cd8c.jpeg" style="width: 302px; height: 222px;" />
 <pre>
 <strong>输入：</strong>nums = [-10,-3,0,5,9]
 <strong>输出：</strong>[0,-3,9,-10,null,5]
 <strong>解释：</strong>[0,-10,5,null,-3,null,9] 也将被视为正确答案：
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/18/btree2.jpg" style="width: 302px; height: 222px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/4d6d8b77285a113d8fceda89c1844413.jpeg" style="width: 302px; height: 222px;" />
 </pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/18/btree.jpg" style="width: 342px; height: 142px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/0d1057250137556d44f0867c7553c7ae.jpeg" style="width: 342px; height: 142px;" />
 <pre>
 <strong>输入：</strong>nums = [1,3]
 <strong>输出：</strong>[3,1]
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/52.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/3.python/52.exercises/solution.md"
index eb6a3c25b..09d63edb3 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/52.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/52.exercises/solution.md"
@@ -11,14 +11,14 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/10/06/balance_1.jpg" style="width: 342px; height: 221px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/341009251c7788edc838975732064bf1.jpeg" style="width: 342px; height: 221px;" />
 <pre>
 <strong>输入：</strong>root = [3,9,20,null,null,15,7]
 <strong>输出：</strong>true
 </pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/10/06/balance_2.jpg" style="width: 452px; height: 301px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/bce64ca4c0e80b345a5a286122112851.jpeg" style="width: 452px; height: 301px;" />
 <pre>
 <strong>输入：</strong>root = [1,2,2,3,3,null,null,4,4]
 <strong>输出：</strong>false
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/53.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/3.python/53.exercises/solution.md"
index abe62efd9..84e88ab2c 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/53.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/53.exercises/solution.md"
@@ -9,7 +9,7 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/10/12/ex_depth.jpg" style="width: 432px; height: 302px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/6d8500c55fe3ebe98dc781d7b62a3bbf.jpeg" style="width: 432px; height: 302px;" />
 <pre>
 <strong>输入：</strong>root = [3,9,20,null,null,15,7]
 <strong>输出：</strong>2
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/54.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/3.python/54.exercises/solution.md"
index 5c554b851..575d34fa7 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/54.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/54.exercises/solution.md"
@@ -7,14 +7,14 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/01/18/pathsum1.jpg" style="width: 500px; height: 356px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/ef95371d9da7672aade4dc505260cc30.jpeg" style="width: 500px; height: 356px;" />
 <pre>
 <strong>输入：</strong>root = [5,4,8,11,null,13,4,7,2,null,null,null,1], targetSum = 22
 <strong>输出：</strong>true
 </pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/01/18/pathsum2.jpg" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/9bc801134935f549d425954a120f1cc3.jpeg" />
 <pre>
 <strong>输入：</strong>root = [1,2,3], targetSum = 5
 <strong>输出：</strong>false
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/55.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/3.python/55.exercises/solution.md"
index 992b73bcd..c0f2eab78 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/55.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/55.exercises/solution.md"
@@ -4,7 +4,7 @@
 
 <p><small>在「杨辉三角」中，每个数是它左上方和右上方的数的和。</small></p>
 
-<p><img alt="" src="https://pic.leetcode-cn.com/1626927345-DZmfxB-PascalTriangleAnimated2.gif" /></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/53cb4e7f630b8a991ebd02133e79a9c8.gif" /></p>
 
 <p> </p>
 
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/56.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/3.python/56.exercises/solution.md"
index 40e04550d..5bf1cecc6 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/56.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/56.exercises/solution.md"
@@ -4,7 +4,7 @@
 
 <p><small>在「杨辉三角」中，每个数是它左上方和右上方的数的和。</small></p>
 
-<p><img alt="" src="https://pic.leetcode-cn.com/1626927345-DZmfxB-PascalTriangleAnimated2.gif" /></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/53cb4e7f630b8a991ebd02133e79a9c8.gif" /></p>
 
 <p> </p>
 
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/61.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/3.python/61.exercises/solution.md"
index 1f1b4ca44..1e84cda3b 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/61.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/61.exercises/solution.md"
@@ -16,7 +16,7 @@
 
 <p><strong>示例 1：</strong></p>
 
-<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/12/07/circularlinkedlist.png" style="height: 97px; width: 300px;"></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/4a18acda10c1606aa5d1132b9de26d61.png" style="height: 97px; width: 300px;"></p>
 
 <pre><strong>输入：</strong>head = [3,2,0,-4], pos = 1
 <strong>输出：</strong>true
@@ -25,7 +25,7 @@
 
 <p><strong>示例&nbsp;2：</strong></p>
 
-<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>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/1a6fcfc68d7340c39151075f7fa53150.png" style="height: 74px; width: 141px;"></p>
 
 <pre><strong>输入：</strong>head = [1,2], pos = 0
 <strong>输出：</strong>true
@@ -34,7 +34,7 @@
 
 <p><strong>示例 3：</strong></p>
 
-<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>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/3039274e08a9385ea77b20a81060ed40.png" style="height: 45px; width: 45px;"></p>
 
 <pre><strong>输入：</strong>head = [1], pos = -1
 <strong>输出：</strong>false
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/62.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/3.python/62.exercises/solution.md"
index 4f5736bbc..73f6e557e 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/62.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/62.exercises/solution.md"
@@ -5,7 +5,7 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/09/15/inorder_1.jpg" style="width: 202px; height: 324px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/93c03b302d4108b3debe3c473af634ea.jpeg" style="width: 202px; height: 324px;" />
 <pre>
 <strong>输入：</strong>root = [1,null,2,3]
 <strong>输出：</strong>[1,2,3]
@@ -26,14 +26,14 @@
 </pre>
 
 <p><strong>示例 4：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/09/15/inorder_5.jpg" style="width: 202px; height: 202px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/428ab6a3e4c104cf4b41ad1a1a0a6f24.jpeg" style="width: 202px; height: 202px;" />
 <pre>
 <strong>输入：</strong>root = [1,2]
 <strong>输出：</strong>[1,2]
 </pre>
 
 <p><strong>示例 5：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/09/15/inorder_4.jpg" style="width: 202px; height: 202px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/67437fd84487294f797443df319c90e9.jpeg" style="width: 202px; height: 202px;" />
 <pre>
 <strong>输入：</strong>root = [1,null,2]
 <strong>输出：</strong>[1,2]
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/65.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/3.python/65.exercises/solution.md"
index 09478dd85..dc8db4280 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/65.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/65.exercises/solution.md"
@@ -4,7 +4,7 @@
 
 <p>图示两个链表在节点 <code>c1</code> 开始相交<strong>：</strong></p>
 
-<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>
+<p><a href="https://img-service.csdnimg.cn/img_convert/4083c2324afbdd75cf739822d75aa194.png" target="_blank"><img alt="" src="https://img-service.csdnimg.cn/img_convert/4083c2324afbdd75cf739822d75aa194.png" style="height: 130px; width: 400px;" /></a></p>
 
 <p>题目数据 <strong>保证</strong> 整个链式结构中不存在环。</p>
 
@@ -14,7 +14,7 @@
 
 <p><strong>示例 1：</strong></p>
 
-<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>
+<p><a href="https://assets.leetcode.com/uploads/2018/12/13/160_example_1.png" target="_blank"><img alt="" src="https://img-service.csdnimg.cn/img_convert/ae6d8589871f13c05f80d247fc7f842e.png" style="height: 130px; width: 400px;" /></a></p>
 
 <pre>
 <strong>输入：</strong>intersectVal = 8, listA = [4,1,8,4,5], listB = [5,0,1,8,4,5], skipA = 2, skipB = 3
@@ -26,7 +26,7 @@
 
 <p><strong>示例 2：</strong></p>
 
-<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>
+<p><a href="https://assets.leetcode.com/uploads/2018/12/13/160_example_2.png" target="_blank"><img alt="" src="https://img-service.csdnimg.cn/img_convert/6bba6ee050d87974cf8d47c34f7d454d.png" style="height: 136px; width: 350px;" /></a></p>
 
 <pre>
 <strong>输入：</strong>intersectVal = 2, listA = [0,9,1,2,4], listB = [3,2,4], skipA = 3, skipB = 1
@@ -38,7 +38,7 @@
 
 <p><strong>示例 3：</strong></p>
 
-<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>
+<p><a href="https://assets.leetcode.com/uploads/2018/12/13/160_example_3.png" target="_blank"><img alt="" src="https://img-service.csdnimg.cn/img_convert/0dede36b1b22b3304429b96d722cc282.png" style="height: 126px; width: 200px;" /></a></p>
 
 <pre>
 <strong>输入：</strong>intersectVal = 0, listA = [2,6,4], listB = [1,5], skipA = 3, skipB = 2
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/74.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/3.python/74.exercises/solution.md"
index c90595f14..c76ca7b8e 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/74.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/74.exercises/solution.md"
@@ -4,7 +4,7 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/03/06/removelinked-list.jpg" style="width: 500px; height: 142px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/77a1c3b8a1c4066a5773b6eb8738e857.jpeg" style="width: 500px; height: 142px;" />
 <pre>
 <strong>输入：</strong>head = [1,2,6,3,4,5,6], val = 6
 <strong>输出：</strong>[1,2,3,4,5]
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/77.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/3.python/77.exercises/solution.md"
index 632ad8989..df9548177 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/77.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/77.exercises/solution.md"
@@ -6,14 +6,14 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/rev1ex1.jpg" style="width: 542px; height: 222px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/1479f99ec2d8583971cc3dfb0c59e0cb.jpeg" style="width: 542px; height: 222px;" />
 <pre>
 <strong>输入：</strong>head = [1,2,3,4,5]
 <strong>输出：</strong>[5,4,3,2,1]
 </pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/rev1ex2.jpg" style="width: 182px; height: 222px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/1b87f6d74f7125930f57958e210e996b.jpeg" style="width: 182px; height: 222px;" />
 <pre>
 <strong>输入：</strong>head = [1,2]
 <strong>输出：</strong>[2,1]
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/85.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/3.python/85.exercises/solution.md"
index 5f206779e..a4a5c1440 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/85.exercises/solution.md"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/85.exercises/solution.md"
@@ -5,14 +5,14 @@
 <p>&nbsp;</p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/03/03/pal1linked-list.jpg" style="width: 422px; height: 62px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/70b052810fbc7389fc6c77e5f8a7f388.jpeg" style="width: 422px; height: 62px;" />
 <pre>
 <strong>输入：</strong>head = [1,2,2,1]
 <strong>输出：</strong>true
 </pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/03/03/pal2linked-list.jpg" style="width: 182px; height: 62px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/2ecd174396cb07fbc62c7c4f0a851623.jpeg" style="width: 182px; height: 62px;" />
 <pre>
 <strong>输入：</strong>head = [1,2]
 <strong>输出：</strong>false
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/100.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/100.exercises/solution.md"
index 436bf0907..cd090b4ba 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/100.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/100.exercises/solution.md"
@@ -16,7 +16,7 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/num1tree.jpg" style="width: 212px; height: 182px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/c5a171500238f60dc577e49c2a6122ca.jpeg" style="width: 212px; height: 182px;" />
 <pre>
 <strong>输入：</strong>root = [1,2,3]
 <strong>输出：</strong>25
@@ -26,7 +26,7 @@
 因此，数字总和 = 12 + 13 = <code>25</code></pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/num2tree.jpg" style="width: 292px; height: 302px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/3a1c0b2f9917c246eb105ce6c3747969.jpeg" style="width: 292px; height: 302px;" />
 <pre>
 <strong>输入：</strong>root = [4,9,0,5,1]
 <strong>输出：</strong>1026
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/101.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/101.exercises/solution.md"
index cd76118ca..36e7c6eb6 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/101.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/101.exercises/solution.md"
@@ -6,7 +6,7 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/xogrid.jpg" style="width: 550px; height: 237px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/5a3a22bfad68fd1d22012a0ee48ec665.jpeg" style="width: 550px; height: 237px;" />
 <pre>
 <strong>输入：</strong>board = [["X","X","X","X"],["X","O","O","X"],["X","X","O","X"],["X","O","X","X"]]
 <strong>输出：</strong>[["X","X","X","X"],["X","X","X","X"],["X","X","X","X"],["X","O","X","X"]]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/103.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/103.exercises/solution.md"
index 89b5548bc..ed08f54b2 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/103.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/103.exercises/solution.md"
@@ -23,7 +23,7 @@
 
 <p><strong>示例 1：</strong></p>
 
-<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/02/01/133_clone_graph_question.png" style="height: 500px; width: 500px;"></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/4665a14e8275dcebde63ce3942d110d2.png" style="height: 500px; width: 500px;"></p>
 
 <pre><strong>输入：</strong>adjList = [[2,4],[1,3],[2,4],[1,3]]
 <strong>输出：</strong>[[2,4],[1,3],[2,4],[1,3]]
@@ -37,7 +37,7 @@
 
 <p><strong>示例 2：</strong></p>
 
-<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/02/01/graph.png" style="height: 148px; width: 163px;"></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/8cfbd9dc508e987b546cd2f0fd792014.png" style="height: 148px; width: 163px;"></p>
 
 <pre><strong>输入：</strong>adjList = [[]]
 <strong>输出：</strong>[[]]
@@ -53,7 +53,7 @@
 
 <p><strong>示例 4：</strong></p>
 
-<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/02/01/graph-1.png" style="height: 133px; width: 272px;"></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/dc82e82c9a0f178d4d1b6f5a85353dee.png" style="height: 133px; width: 272px;"></p>
 
 <pre><strong>输入：</strong>adjList = [[2],[1]]
 <strong>输出：</strong>[[2],[1]]</pre>
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/106.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/106.exercises/solution.md"
index ff6fecccf..182c8a981 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/106.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/106.exercises/solution.md"
@@ -21,7 +21,7 @@
 
 <p><strong>示例 1：</strong></p>
 
-<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/01/09/e1.png" style="height: 138px; width: 680px;" /></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/f8f9507766d2b669c1fc4602abb42bcc.png" style="height: 138px; width: 680px;" /></p>
 
 <pre>
 <strong>输入：</strong>head = [[7,null],[13,0],[11,4],[10,2],[1,0]]
@@ -30,7 +30,7 @@
 
 <p><strong>示例 2：</strong></p>
 
-<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/01/09/e2.png" style="height: 111px; width: 680px;" /></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/5b1d9935e44c90100e9e651df9c95804.png" style="height: 111px; width: 680px;" /></p>
 
 <pre>
 <strong>输入：</strong>head = [[1,1],[2,1]]
@@ -39,7 +39,7 @@
 
 <p><strong>示例 3：</strong></p>
 
-<p><strong><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/01/09/e3.png" style="height: 119px; width: 680px;" /></strong></p>
+<p><strong><img alt="" src="https://img-service.csdnimg.cn/img_convert/644c55218eecea6200881f4bea3a3a95.png" style="height: 119px; width: 680px;" /></strong></p>
 
 <pre>
 <strong>输入：</strong>head = [[3,null],[3,0],[3,null]]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/108.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/108.exercises/solution.md"
index d926ada51..7a227922c 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/108.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/108.exercises/solution.md"
@@ -16,7 +16,7 @@
 
 <p><strong>示例 1：</strong></p>
 
-<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/12/07/circularlinkedlist.png" style="height: 97px; width: 300px;" /></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/4a18acda10c1606aa5d1132b9de26d61.png" style="height: 97px; width: 300px;" /></p>
 
 <pre>
 <strong>输入：</strong>head = [3,2,0,-4], pos = 1
@@ -26,7 +26,7 @@
 
 <p><strong>示例 2：</strong></p>
 
-<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>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/1a6fcfc68d7340c39151075f7fa53150.png" style="height: 74px; width: 141px;" /></p>
 
 <pre>
 <strong>输入：</strong>head = [1,2], pos = 0
@@ -36,7 +36,7 @@
 
 <p><strong>示例 3：</strong></p>
 
-<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>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/3039274e08a9385ea77b20a81060ed40.png" style="height: 45px; width: 45px;" /></p>
 
 <pre>
 <strong>输入：</strong>head = [1], pos = -1
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/109.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/109.exercises/solution.md"
index 7872033b6..6b47c5158 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/109.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/109.exercises/solution.md"
@@ -13,7 +13,7 @@
 
 <p><strong>示例 1:</strong></p>
 
-<p><img alt="" src="https://pic.leetcode-cn.com/1626420311-PkUiGI-image.png" style="width: 240px; " /></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/749247317f1c95079a7daa32d6b7da96.png" style="width: 240px; " /></p>
 
 <pre>
 <strong>输入: </strong>head = [1,2,3,4]
@@ -21,7 +21,7 @@
 
 <p><strong>示例 2:</strong></p>
 
-<p><img alt="" src="https://pic.leetcode-cn.com/1626420320-YUiulT-image.png" style="width: 320px; " /></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/f425cb8c2d72409c26564abcdb8cb629.png" style="width: 320px; " /></p>
 
 <pre>
 <strong>输入: </strong>head = [1,2,3,4,5]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/111.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/111.exercises/solution.md"
index cd8e1e2b0..16a4900c7 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/111.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/111.exercises/solution.md"
@@ -2,7 +2,7 @@
 
 <p>对链表进行插入排序。</p>
 
-<p><img alt="" src="https://upload.wikimedia.org/wikipedia/commons/0/0f/Insertion-sort-example-300px.gif"><br>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/9400029b6559a5f16c48610324ceb961.png"><br>
 <small>插入排序的动画演示如上。从第一个元素开始，该链表可以被认为已经部分排序（用黑色表示）。<br>
 每次迭代时，从输入数据中移除一个元素（用红色表示），并原地将其插入到已排好序的链表中。</small></p>
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/112.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/112.exercises/solution.md"
index 517ce6fbe..8a08228a1 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/112.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/112.exercises/solution.md"
@@ -11,14 +11,14 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/09/14/sort_list_1.jpg" style="width: 302px; "/>
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/f2b8957105894d4fe9ffe9462e65f8e8.jpeg" style="width: 302px; "/>
 <pre>
 <b>输入：</b>head = [4,2,1,3]
 <b>输出：</b>[1,2,3,4]
 </pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/09/14/sort_list_2.jpg" style="width: 402px; " />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/f10bc169c916b5b0bc8651e5f7e99492.jpeg" style="width: 402px; " />
 <pre>
 <b>输入：</b>head = [-1,5,3,4,0]
 <b>输出：</b>[-1,0,3,4,5]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/120.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/120.exercises/solution.md"
index 1e7b06214..1073feb97 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/120.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/120.exercises/solution.md"
@@ -18,7 +18,7 @@
 <p> </p>
 
 <p><strong>示例：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2018/12/25/bst-tree.png" style="width: 189px; height: 178px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/743f55b78d358ff4ba5fbb7d8088a0d9.png" style="width: 189px; height: 178px;" />
 <pre>
 <strong>输入</strong>
 ["BSTIterator", "next", "next", "hasNext", "next", "hasNext", "next", "hasNext", "next", "hasNext"]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/125.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/125.exercises/solution.md"
index a98d76cd2..00aea3304 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/125.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/125.exercises/solution.md"
@@ -6,7 +6,7 @@
 
 <p><strong>示例 1:</strong></p>
 
-<p><img src="https://assets.leetcode.com/uploads/2021/02/14/tree.jpg" style="width: 270px; " /></p>
+<p><img src="https://img-service.csdnimg.cn/img_convert/d8e254ac37a1738da124338966297a76.jpeg" style="width: 270px; " /></p>
 
 <pre>
 <strong>输入:</strong> [1,2,3,null,5,null,4]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/29.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/29.exercises/solution.md"
index 0a79020ca..466161676 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/29.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/29.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 恢复二叉搜索树
 
-<p>给你二叉搜索树的根节点 <code>root</code> ，该树中的两个节点被错误地交换。请在不改变其结构的情况下，恢复这棵树。</p><p><strong>进阶：</strong>使用 O(<em>n</em>) 空间复杂度的解法很容易实现。你能想出一个只使用常数空间的解决方案吗？</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0099.Recover%20Binary%20Search%20Tree/images/recover1.jpg" style="width: 422px; height: 302px;" /><pre><strong>输入：</strong>root = [1,3,null,null,2]<strong><br />输出：</strong>[3,1,null,null,2]<strong><br />解释：</strong>3 不能是 1 左孩子，因为 3 > 1 。交换 1 和 3 使二叉搜索树有效。</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0099.Recover%20Binary%20Search%20Tree/images/recover2.jpg" style="width: 581px; height: 302px;" /><pre><strong>输入：</strong>root = [3,1,4,null,null,2]<strong><br />输出：</strong>[2,1,4,null,null,3]<strong><br />解释：</strong>2 不能在 3 的右子树中，因为 2 < 3 。交换 2 和 3 使二叉搜索树有效。</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>树上节点的数目在范围 <code>[2, 1000]</code> 内</li>	<li><code>-2<sup>31</sup> <= Node.val <= 2<sup>31</sup> - 1</code></li></ul>
+<p>给你二叉搜索树的根节点 <code>root</code> ，该树中的两个节点被错误地交换。请在不改变其结构的情况下，恢复这棵树。</p><p><strong>进阶：</strong>使用 O(<em>n</em>) 空间复杂度的解法很容易实现。你能想出一个只使用常数空间的解决方案吗？</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/ec4e4b2849cccb75be04428664afb2fc.jpeg" style="width: 422px; height: 302px;" /><pre><strong>输入：</strong>root = [1,3,null,null,2]<strong><br />输出：</strong>[3,1,null,null,2]<strong><br />解释：</strong>3 不能是 1 左孩子，因为 3 > 1 。交换 1 和 3 使二叉搜索树有效。</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/c039bf633cb8b3bfbb70a26e931a4f53.jpeg" style="width: 581px; height: 302px;" /><pre><strong>输入：</strong>root = [3,1,4,null,null,2]<strong><br />输出：</strong>[2,1,4,null,null,3]<strong><br />解释：</strong>2 不能在 3 的右子树中，因为 2 < 3 。交换 2 和 3 使二叉搜索树有效。</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>树上节点的数目在范围 <code>[2, 1000]</code> 内</li>	<li><code>-2<sup>31</sup> <= Node.val <= 2<sup>31</sup> - 1</code></li></ul>
 
 以下程序实现了这一功能，请你填补空白处内容：
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/31.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/31.exercises/solution.md"
index 2aebef569..29adbceba 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/31.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/31.exercises/solution.md"
@@ -5,7 +5,7 @@
 <p>问总共有多少条不同的路径？</p>
 <p> </p>
 <p><strong>示例 1：</strong></p><img
-    src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0062.Unique%20Paths/images/robot_maze.png" />
+    src="https://img-service.csdnimg.cn/img_convert/099169dc43ebe3d42afb948803f38eda.png" />
 <pre><strong>输入：</strong>m = 3, n = 7<strong><br />输出：</strong>28</pre>
 <p><strong>示例 2：</strong></p>
 <pre><strong>输入：</strong>m = 3, n = 2<strong><br />输出：</strong>3<strong><br />解释：</strong>从左上角开始，总共有 3 条路径可以到达右下角。<br />1. 向右 -> 向下 -> 向下<br />2. 向下 -> 向下 -> 向右<br />3. 向下 -> 向右 -> 向下</pre>
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/32.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/32.exercises/solution.md"
index 940854b27..6e16c3b4d 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/32.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/32.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 电话号码的字母组合
 
-<p>给定一个仅包含数字 <code>2-9</code> 的字符串，返回所有它能表示的字母组合。答案可以按 <strong>任意顺序</strong> 返回。</p><p>给出数字到字母的映射如下（与电话按键相同）。注意 1 不对应任何字母。</p><p><img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0017.Letter%20Combinations%20of%20a%20Phone%20Number/images/17_telephone_keypad.png" style="width: 200px;" /></p><p> </p><p><strong>示例 1：</strong></p><pre><strong>输入：</strong>digits = "23"<strong><br />输出：</strong>["ad","ae","af","bd","be","bf","cd","ce","cf"]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>digits = ""<strong><br />输出：</strong>[]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>digits = "2"<strong><br />输出：</strong>["a","b","c"]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>0 <= digits.length <= 4</code></li>	<li><code>digits[i]</code> 是范围 <code>['2', '9']</code> 的一个数字。</li></ul>
+<p>给定一个仅包含数字 <code>2-9</code> 的字符串，返回所有它能表示的字母组合。答案可以按 <strong>任意顺序</strong> 返回。</p><p>给出数字到字母的映射如下（与电话按键相同）。注意 1 不对应任何字母。</p><p><img src="https://img-service.csdnimg.cn/img_convert/71e2c27cd43a6f678c1972f865e982d0.png" style="width: 200px;" /></p><p> </p><p><strong>示例 1：</strong></p><pre><strong>输入：</strong>digits = "23"<strong><br />输出：</strong>["ad","ae","af","bd","be","bf","cd","ce","cf"]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>digits = ""<strong><br />输出：</strong>[]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>digits = "2"<strong><br />输出：</strong>["a","b","c"]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>0 <= digits.length <= 4</code></li>	<li><code>digits[i]</code> 是范围 <code>['2', '9']</code> 的一个数字。</li></ul>
 
 以下程序实现了这一功能，请你填补空白处内容：
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/33.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/33.exercises/solution.md"
index 830cf2331..5bd5168aa 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/33.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/33.exercises/solution.md"
@@ -11,7 +11,7 @@
         <div>
             <p><strong>示例 1：</strong></p>
             <img style="width: 600px; height: 148px;"
-                src="https://assets.leetcode.com/uploads/2021/01/18/uniquebstn3.jpg" alt="">
+                src="https://img-service.csdnimg.cn/img_convert/afa8711beb3c6f3c54d039379f525fb7.jpeg" alt="">
             <pre><strong>输入：</strong>n = 3
 <strong>输出：</strong>[[1,null,2,null,3],[1,null,3,2],[2,1,3],[3,1,null,null,2],[3,2,null,1]]
     </pre>
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/35.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/35.exercises/solution.md"
index 2442a1c00..733d83322 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/35.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/35.exercises/solution.md"
@@ -7,7 +7,7 @@
     <p>&nbsp;</p>
 
     <p><strong>示例 1：</strong></p>
-    <img style="width: 600px; height: 148px;" src="https://assets.leetcode.com/uploads/2021/01/18/uniquebstn3.jpg"
+    <img style="width: 600px; height: 148px;" src="https://img-service.csdnimg.cn/img_convert/afa8711beb3c6f3c54d039379f525fb7.jpeg"
         alt="">
     <pre><strong>输入：</strong>n = 3
 <strong>输出：</strong>5
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/38.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/38.exercises/solution.md"
index 3d276ecdd..4dc392854 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/38.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/38.exercises/solution.md"
@@ -32,7 +32,7 @@
 
     <p>例如，数字字符串 <code>"3322251"</code> 的描述如下图：</p>
     <img alt=""
-        src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0038.Count%20and%20Say/images/countandsay.jpg"
+        src="https://img-service.csdnimg.cn/img_convert/23bfeaec5ed390ee12e4ab4f6bd7da5a.jpeg"
         style="width: 581px; height: 172px;" />
     <ul>
     </ul>
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/39.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/39.exercises/solution.md"
index 415583b16..1151886f5 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/39.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/39.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 旋转链表
 
-<p>给你一个链表的头节点 <code>head</code> ，旋转链表，将链表每个节点向右移动 <code>k</code><em> </em>个位置。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0061.Rotate%20List/images/rotate1.jpg" style="width: 600px; height: 254px;" /><pre><strong>输入：</strong>head = [1,2,3,4,5], k = 2<strong><br />输出：</strong>[4,5,1,2,3]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0061.Rotate%20List/images/roate2.jpg" style="width: 472px; height: 542px;" /><pre><strong>输入：</strong>head = [0,1,2], k = 4<strong><br />输出：</strong>[2,0,1]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点的数目在范围 <code>[0, 500]</code> 内</li>	<li><code>-100 <= Node.val <= 100</code></li>	<li><code>0 <= k <= 2 * 10<sup>9</sup></code></li></ul>
+<p>给你一个链表的头节点 <code>head</code> ，旋转链表，将链表每个节点向右移动 <code>k</code><em> </em>个位置。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/c0d8ae472058ab78d44488d3d18b7d34.jpeg" style="width: 600px; height: 254px;" /><pre><strong>输入：</strong>head = [1,2,3,4,5], k = 2<strong><br />输出：</strong>[4,5,1,2,3]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/b36376b20ad1074341ffc8bca9a32eca.jpeg" style="width: 472px; height: 542px;" /><pre><strong>输入：</strong>head = [0,1,2], k = 4<strong><br />输出：</strong>[2,0,1]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点的数目在范围 <code>[0, 500]</code> 内</li>	<li><code>-100 <= Node.val <= 100</code></li>	<li><code>0 <= k <= 2 * 10<sup>9</sup></code></li></ul>
 
 以下程序实现了这一功能，请你填补空白处内容：
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/4.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/4.exercises/solution.md"
index eb9b298b4..798fa9b77 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/4.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/4.exercises/solution.md"
@@ -2,7 +2,7 @@
 
 <p>一个整型数组有10元素&#xff0c;请先给这10个元素赋值&#xff0c;然后随便输入一个数&#xff0c;最后输出数组中比这个数小的所有元素&#xff0c;每个数用空格隔开&#xff0c;如果没有找到&#xff0c;则输出not find。<br />
  </p>
-<p style="text-align:center"><img alt="" src="https://img-ask.csdnimg.cn/upload/1624519041254.jpg" />
+<p style="text-align:center"><img alt="" src="https://img-service.csdnimg.cn/img_convert/ca7823918ff2609bfc9edc9c4d84ab3c.jpeg" />
  </p>
 
 以下程序实现了这一功能，请你填补空白处内容：
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/42.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/42.exercises/solution.md"
index acbda4475..0ba35fab4 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/42.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/42.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 旋转图像
 
-<p>给定一个 <em>n </em>× <em>n</em> 的二维矩阵 <code>matrix</code> 表示一个图像。请你将图像顺时针旋转 90 度。</p><p>你必须在<strong><a href="https://baike.baidu.com/item/%E5%8E%9F%E5%9C%B0%E7%AE%97%E6%B3%95" target="_blank"> 原地</a></strong> 旋转图像，这意味着你需要直接修改输入的二维矩阵。<strong>请不要 </strong>使用另一个矩阵来旋转图像。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0048.Rotate%20Image/images/mat1.jpg" style="width: 642px; height: 242px;" /><pre><strong>输入：</strong>matrix = [[1,2,3],[4,5,6],[7,8,9]]<strong><br />输出：</strong>[[7,4,1],[8,5,2],[9,6,3]]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0048.Rotate%20Image/images/mat2.jpg" style="width: 800px; height: 321px;" /><pre><strong>输入：</strong>matrix = [[5,1,9,11],[2,4,8,10],[13,3,6,7],[15,14,12,16]]<strong><br />输出：</strong>[[15,13,2,5],[14,3,4,1],[12,6,8,9],[16,7,10,11]]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>matrix = [[1]]<strong><br />输出：</strong>[[1]]</pre><p><strong>示例 4：</strong></p><pre><strong>输入：</strong>matrix = [[1,2],[3,4]]<strong><br />输出：</strong>[[3,1],[4,2]]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>matrix.length == n</code></li>	<li><code>matrix[i].length == n</code></li>	<li><code>1 <= n <= 20</code></li>	<li><code>-1000 <= matrix[i][j] <= 1000</code></li></ul>
+<p>给定一个 <em>n </em>× <em>n</em> 的二维矩阵 <code>matrix</code> 表示一个图像。请你将图像顺时针旋转 90 度。</p><p>你必须在<strong><a href="https://baike.baidu.com/item/%E5%8E%9F%E5%9C%B0%E7%AE%97%E6%B3%95" target="_blank"> 原地</a></strong> 旋转图像，这意味着你需要直接修改输入的二维矩阵。<strong>请不要 </strong>使用另一个矩阵来旋转图像。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/9a815a9eeb64d633de1bcd8d864f069d.jpeg" style="width: 642px; height: 242px;" /><pre><strong>输入：</strong>matrix = [[1,2,3],[4,5,6],[7,8,9]]<strong><br />输出：</strong>[[7,4,1],[8,5,2],[9,6,3]]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/5f637f84287da51eb330d2128bfb306f.jpeg" style="width: 800px; height: 321px;" /><pre><strong>输入：</strong>matrix = [[5,1,9,11],[2,4,8,10],[13,3,6,7],[15,14,12,16]]<strong><br />输出：</strong>[[15,13,2,5],[14,3,4,1],[12,6,8,9],[16,7,10,11]]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>matrix = [[1]]<strong><br />输出：</strong>[[1]]</pre><p><strong>示例 4：</strong></p><pre><strong>输入：</strong>matrix = [[1,2],[3,4]]<strong><br />输出：</strong>[[3,1],[4,2]]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>matrix.length == n</code></li>	<li><code>matrix[i].length == n</code></li>	<li><code>1 <= n <= 20</code></li>	<li><code>-1000 <= matrix[i][j] <= 1000</code></li></ul>
 
 以下程序实现了这一功能，请你填补空白处内容：
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/43.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/43.exercises/solution.md"
index 96e4feb67..708bf563b 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/43.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/43.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 盛最多水的容器
 
-<p>给你 <code>n</code> 个非负整数 <code>a<sub>1</sub>，a<sub>2，</sub>...，a</code><sub><code>n</code>，</sub>每个数代表坐标中的一个点 <code>(i, a<sub>i</sub>)</code> 。在坐标内画 <code>n</code> 条垂直线，垂直线 <code>i</code> 的两个端点分别为 <code>(i, a<sub>i</sub>)</code> 和 <code>(i, 0)</code> 。找出其中的两条线，使得它们与 <code>x</code> 轴共同构成的容器可以容纳最多的水。</p><p><strong>说明：</strong>你不能倾斜容器。</p><p> </p><p><strong>示例 1：</strong></p><p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0011.Container%20With%20Most%20Water/images/question_11.jpg" style="height: 287px; width: 600px;" /></p><pre><strong>输入：</strong>[1,8,6,2,5,4,8,3,7]<strong><br />输出：</strong>49 <strong><br />解释：</strong>图中垂直线代表输入数组 [1,8,6,2,5,4,8,3,7]。在此情况下，容器能够容纳水（表示为蓝色部分）的最大值为 49。</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>height = [1,1]<strong><br />输出：</strong>1</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>height = [4,3,2,1,4]<strong><br />输出：</strong>16</pre><p><strong>示例 4：</strong></p><pre><strong>输入：</strong>height = [1,2,1]<strong><br />输出：</strong>2</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>n = height.length</code></li>	<li><code>2 <= n <= 3 * 10<sup>4</sup></code></li>	<li><code>0 <= height[i] <= 3 * 10<sup>4</sup></code></li></ul>
+<p>给你 <code>n</code> 个非负整数 <code>a<sub>1</sub>，a<sub>2，</sub>...，a</code><sub><code>n</code>，</sub>每个数代表坐标中的一个点 <code>(i, a<sub>i</sub>)</code> 。在坐标内画 <code>n</code> 条垂直线，垂直线 <code>i</code> 的两个端点分别为 <code>(i, a<sub>i</sub>)</code> 和 <code>(i, 0)</code> 。找出其中的两条线，使得它们与 <code>x</code> 轴共同构成的容器可以容纳最多的水。</p><p><strong>说明：</strong>你不能倾斜容器。</p><p> </p><p><strong>示例 1：</strong></p><p><img alt="" src="https://img-service.csdnimg.cn/img_convert/68b73af992268f52fa1d1edf7891fcc2.jpeg" style="height: 287px; width: 600px;" /></p><pre><strong>输入：</strong>[1,8,6,2,5,4,8,3,7]<strong><br />输出：</strong>49 <strong><br />解释：</strong>图中垂直线代表输入数组 [1,8,6,2,5,4,8,3,7]。在此情况下，容器能够容纳水（表示为蓝色部分）的最大值为 49。</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>height = [1,1]<strong><br />输出：</strong>1</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>height = [4,3,2,1,4]<strong><br />输出：</strong>16</pre><p><strong>示例 4：</strong></p><pre><strong>输入：</strong>height = [1,2,1]<strong><br />输出：</strong>2</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>n = height.length</code></li>	<li><code>2 <= n <= 3 * 10<sup>4</sup></code></li>	<li><code>0 <= height[i] <= 3 * 10<sup>4</sup></code></li></ul>
 
 以下程序实现了这一功能，请你填补空白处内容：
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/49.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/49.exercises/solution.md"
index f1b28f0e7..5be09aa84 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/49.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/49.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 两数相加
 
-<p>给你两个 <strong>非空</strong> 的链表，表示两个非负的整数。它们每位数字都是按照 <strong>逆序</strong> 的方式存储的，并且每个节点只能存储 <strong>一位</strong> 数字。</p><p>请你将两个数相加，并以相同形式返回一个表示和的链表。</p><p>你可以假设除了数字 0 之外，这两个数都不会以 0 开头。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0002.Add%20Two%20Numbers/images/addtwonumber1.jpg" style="width: 483px; height: 342px;" /><pre><strong>输入：</strong>l1 = [2,4,3], l2 = [5,6,4]<strong><br />输出：</strong>[7,0,8]<strong><br />解释：</strong>342 + 465 = 807.</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>l1 = [0], l2 = [0]<strong><br />输出：</strong>[0]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]<strong><br />输出：</strong>[8,9,9,9,0,0,0,1]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>每个链表中的节点数在范围 <code>[1, 100]</code> 内</li>	<li><code>0 <= Node.val <= 9</code></li>	<li>题目数据保证列表表示的数字不含前导零</li></ul>
+<p>给你两个 <strong>非空</strong> 的链表，表示两个非负的整数。它们每位数字都是按照 <strong>逆序</strong> 的方式存储的，并且每个节点只能存储 <strong>一位</strong> 数字。</p><p>请你将两个数相加，并以相同形式返回一个表示和的链表。</p><p>你可以假设除了数字 0 之外，这两个数都不会以 0 开头。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/3d2b007db4e6d4c6b2b5ec03d67f97e0.jpeg" style="width: 483px; height: 342px;" /><pre><strong>输入：</strong>l1 = [2,4,3], l2 = [5,6,4]<strong><br />输出：</strong>[7,0,8]<strong><br />解释：</strong>342 + 465 = 807.</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>l1 = [0], l2 = [0]<strong><br />输出：</strong>[0]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]<strong><br />输出：</strong>[8,9,9,9,0,0,0,1]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>每个链表中的节点数在范围 <code>[1, 100]</code> 内</li>	<li><code>0 <= Node.val <= 9</code></li>	<li>题目数据保证列表表示的数字不含前导零</li></ul>
 
 以下程序实现了这一功能，请你填补空白处内容：
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/50.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/50.exercises/solution.md"
index 9fd2de036..813a4e139 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/50.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/50.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 分隔链表
 
-<p>给你一个链表的头节点 <code>head</code> 和一个特定值<em> </em><code>x</code> ，请你对链表进行分隔，使得所有 <strong>小于</strong> <code>x</code> 的节点都出现在 <strong>大于或等于</strong> <code>x</code> 的节点之前。</p><p>你应当 <strong>保留</strong> 两个分区中每个节点的初始相对位置。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0086.Partition%20List/images/partition.jpg" style="width: 662px; height: 222px;" /><pre><strong>输入：</strong>head = [1,4,3,2,5,2], x = 3<strong><br />输出</strong>：[1,2,2,4,3,5]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>head = [2,1], x = 2<strong><br />输出</strong>：[1,2]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点的数目在范围 <code>[0, 200]</code> 内</li>	<li><code>-100 <= Node.val <= 100</code></li>	<li><code>-200 <= x <= 200</code></li></ul>
+<p>给你一个链表的头节点 <code>head</code> 和一个特定值<em> </em><code>x</code> ，请你对链表进行分隔，使得所有 <strong>小于</strong> <code>x</code> 的节点都出现在 <strong>大于或等于</strong> <code>x</code> 的节点之前。</p><p>你应当 <strong>保留</strong> 两个分区中每个节点的初始相对位置。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/54f1177fe2cc4fddce6e1a5553659bee.jpeg" style="width: 662px; height: 222px;" /><pre><strong>输入：</strong>head = [1,4,3,2,5,2], x = 3<strong><br />输出</strong>：[1,2,2,4,3,5]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>head = [2,1], x = 2<strong><br />输出</strong>：[1,2]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点的数目在范围 <code>[0, 200]</code> 内</li>	<li><code>-100 <= Node.val <= 100</code></li>	<li><code>-200 <= x <= 200</code></li></ul>
 
 以下程序实现了这一功能，请你填补空白处内容：
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/56.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/56.exercises/solution.md"
index cebcfba66..25547f8d1 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/56.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/56.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 螺旋矩阵
 
-<p>给你一个 <code>m</code> 行 <code>n</code> 列的矩阵 <code>matrix</code> ，请按照 <strong>顺时针螺旋顺序</strong> ，返回矩阵中的所有元素。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0054.Spiral%20Matrix/images/spiral1.jpg" style="width: 242px; height: 242px;" /><pre><strong>输入：</strong>matrix = [[1,2,3],[4,5,6],[7,8,9]]<strong><br />输出：</strong>[1,2,3,6,9,8,7,4,5]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0054.Spiral%20Matrix/images/spiral.jpg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]]<strong><br />输出：</strong>[1,2,3,4,8,12,11,10,9,5,6,7]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>m == matrix.length</code></li>	<li><code>n == matrix[i].length</code></li>	<li><code>1 <= m, n <= 10</code></li>	<li><code>-100 <= matrix[i][j] <= 100</code></li></ul>
+<p>给你一个 <code>m</code> 行 <code>n</code> 列的矩阵 <code>matrix</code> ，请按照 <strong>顺时针螺旋顺序</strong> ，返回矩阵中的所有元素。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/0d476dcc094b85563f4f43c393ef1425.jpeg" style="width: 242px; height: 242px;" /><pre><strong>输入：</strong>matrix = [[1,2,3],[4,5,6],[7,8,9]]<strong><br />输出：</strong>[1,2,3,6,9,8,7,4,5]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/1c83ff2d8f7cc194b08715bacdedff99.jpeg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]]<strong><br />输出：</strong>[1,2,3,4,8,12,11,10,9,5,6,7]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>m == matrix.length</code></li>	<li><code>n == matrix[i].length</code></li>	<li><code>1 <= m, n <= 10</code></li>	<li><code>-100 <= matrix[i][j] <= 100</code></li></ul>
 
 以下程序实现了这一功能，请你填补空白处内容：
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/59.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/59.exercises/solution.md"
index 603ab2310..1ccc1a018 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/59.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/59.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 搜索二维矩阵
 
-<p>编写一个高效的算法来判断 <code>m x n</code> 矩阵中，是否存在一个目标值。该矩阵具有如下特性：</p><ul>	<li>每行中的整数从左到右按升序排列。</li>	<li>每行的第一个整数大于前一行的最后一个整数。</li></ul><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0074.Search%20a%202D%20Matrix/images/mat.jpg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 3<strong><br />输出：</strong>true</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0074.Search%20a%202D%20Matrix/images/mat2.jpg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 13<strong><br />输出：</strong>false</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>m == matrix.length</code></li>	<li><code>n == matrix[i].length</code></li>	<li><code>1 <= m, n <= 100</code></li>	<li><code>-10<sup>4</sup> <= matrix[i][j], target <= 10<sup>4</sup></code></li></ul>
+<p>编写一个高效的算法来判断 <code>m x n</code> 矩阵中，是否存在一个目标值。该矩阵具有如下特性：</p><ul>	<li>每行中的整数从左到右按升序排列。</li>	<li>每行的第一个整数大于前一行的最后一个整数。</li></ul><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/eb4ca0d861f87843d6d732b4525b0acc.jpeg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 3<strong><br />输出：</strong>true</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/f22033e9dda21437197f5e414c912a3d.jpeg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 13<strong><br />输出：</strong>false</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>m == matrix.length</code></li>	<li><code>n == matrix[i].length</code></li>	<li><code>1 <= m, n <= 100</code></li>	<li><code>-10<sup>4</sup> <= matrix[i][j], target <= 10<sup>4</sup></code></li></ul>
 
 以下程序实现了这一功能，请你填补空白处内容：
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/62.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/62.exercises/solution.md"
index cc40b25be..e185cd9cb 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/62.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/62.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 矩阵置零
 
-<p>给定一个 <code><em>m</em> x <em>n</em></code> 的矩阵，如果一个元素为 <strong>0 </strong>，则将其所在行和列的所有元素都设为 <strong>0</strong> 。请使用 <strong><a href="http://baike.baidu.com/item/%E5%8E%9F%E5%9C%B0%E7%AE%97%E6%B3%95" target="_blank">原地</a></strong> 算法<strong>。</strong></p><p><strong>进阶：</strong></p><ul>	<li>一个直观的解决方案是使用  <code>O(<em>m</em><em>n</em>)</code> 的额外空间，但这并不是一个好的解决方案。</li>	<li>一个简单的改进方案是使用 <code>O(<em>m</em> + <em>n</em>)</code> 的额外空间，但这仍然不是最好的解决方案。</li>	<li>你能想出一个仅使用常量空间的解决方案吗？</li></ul><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0073.Set%20Matrix%20Zeroes/images/mat1.jpg" style="width: 450px; height: 169px;" /><pre><strong>输入：</strong>matrix = [[1,1,1],[1,0,1],[1,1,1]]<strong><br />输出：</strong>[[1,0,1],[0,0,0],[1,0,1]]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0073.Set%20Matrix%20Zeroes/images/mat2.jpg" style="width: 450px; height: 137px;" /><pre><strong>输入：</strong>matrix = [[0,1,2,0],[3,4,5,2],[1,3,1,5]]<strong><br />输出：</strong>[[0,0,0,0],[0,4,5,0],[0,3,1,0]]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>m == matrix.length</code></li>	<li><code>n == matrix[0].length</code></li>	<li><code>1 <= m, n <= 200</code></li>	<li><code>-2<sup>31</sup> <= matrix[i][j] <= 2<sup>31</sup> - 1</code></li></ul>
+<p>给定一个 <code><em>m</em> x <em>n</em></code> 的矩阵，如果一个元素为 <strong>0 </strong>，则将其所在行和列的所有元素都设为 <strong>0</strong> 。请使用 <strong><a href="http://baike.baidu.com/item/%E5%8E%9F%E5%9C%B0%E7%AE%97%E6%B3%95" target="_blank">原地</a></strong> 算法<strong>。</strong></p><p><strong>进阶：</strong></p><ul>	<li>一个直观的解决方案是使用  <code>O(<em>m</em><em>n</em>)</code> 的额外空间，但这并不是一个好的解决方案。</li>	<li>一个简单的改进方案是使用 <code>O(<em>m</em> + <em>n</em>)</code> 的额外空间，但这仍然不是最好的解决方案。</li>	<li>你能想出一个仅使用常量空间的解决方案吗？</li></ul><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/a9dfa884d1a855d6630087aa890a20f8.jpeg" style="width: 450px; height: 169px;" /><pre><strong>输入：</strong>matrix = [[1,1,1],[1,0,1],[1,1,1]]<strong><br />输出：</strong>[[1,0,1],[0,0,0],[1,0,1]]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/816bcf700b7a5b0c1b118f9aaac5bb58.jpeg" style="width: 450px; height: 137px;" /><pre><strong>输入：</strong>matrix = [[0,1,2,0],[3,4,5,2],[1,3,1,5]]<strong><br />输出：</strong>[[0,0,0,0],[0,4,5,0],[0,3,1,0]]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>m == matrix.length</code></li>	<li><code>n == matrix[0].length</code></li>	<li><code>1 <= m, n <= 200</code></li>	<li><code>-2<sup>31</sup> <= matrix[i][j] <= 2<sup>31</sup> - 1</code></li></ul>
 
 以下程序实现了这一功能，请你填补空白处内容：
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/65.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/65.exercises/solution.md"
index ff8a65791..631226a69 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/65.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/65.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 反转链表 II
 
-给你单链表的头指针 <code>head</code> 和两个整数 <code>left</code> 和 <code>right</code> ，其中 <code>left <= right</code> 。请你反转从位置 <code>left</code> 到位置 <code>right</code> 的链表节点，返回 <strong>反转后的链表</strong> 。<p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0092.Reverse%20Linked%20List%20II/images/rev2ex2.jpg" style="width: 542px; height: 222px;" /><pre><strong>输入：</strong>head = [1,2,3,4,5], left = 2, right = 4<strong><br />输出：</strong>[1,4,3,2,5]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>head = [5], left = 1, right = 1<strong><br />输出：</strong>[5]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点数目为 <code>n</code></li>	<li><code>1 <= n <= 500</code></li>	<li><code>-500 <= Node.val <= 500</code></li>	<li><code>1 <= left <= right <= n</code></li></ul><p> </p><p><strong>进阶：</strong> 你可以使用一趟扫描完成反转吗？</p>
+给你单链表的头指针 <code>head</code> 和两个整数 <code>left</code> 和 <code>right</code> ，其中 <code>left <= right</code> 。请你反转从位置 <code>left</code> 到位置 <code>right</code> 的链表节点，返回 <strong>反转后的链表</strong> 。<p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/c664df96e99b9097662307d2e0368322.jpeg" style="width: 542px; height: 222px;" /><pre><strong>输入：</strong>head = [1,2,3,4,5], left = 2, right = 4<strong><br />输出：</strong>[1,4,3,2,5]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>head = [5], left = 1, right = 1<strong><br />输出：</strong>[5]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点数目为 <code>n</code></li>	<li><code>1 <= n <= 500</code></li>	<li><code>-500 <= Node.val <= 500</code></li>	<li><code>1 <= left <= right <= n</code></li></ul><p> </p><p><strong>进阶：</strong> 你可以使用一趟扫描完成反转吗？</p>
 
 以下程序实现了这一功能，请你填补空白处内容：
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/66.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/66.exercises/solution.md"
index 2528efd6b..874080460 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/66.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/66.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 最小路径和
 
-<p>给定一个包含非负整数的 <code><em>m</em> x <em>n</em></code> 网格 <code>grid</code> ，请找出一条从左上角到右下角的路径，使得路径上的数字总和为最小。</p><p><strong>说明：</strong>每次只能向下或者向右移动一步。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0064.Minimum%20Path%20Sum/images/minpath.jpg" style="width: 242px; height: 242px;" /><pre><strong>输入：</strong>grid = [[1,3,1],[1,5,1],[4,2,1]]<strong><br />输出：</strong>7<strong><br />解释：</strong>因为路径 1→3→1→1→1 的总和最小。</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>grid = [[1,2,3],[4,5,6]]<strong><br />输出：</strong>12</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>m == grid.length</code></li>	<li><code>n == grid[i].length</code></li>	<li><code>1 <= m, n <= 200</code></li>	<li><code>0 <= grid[i][j] <= 100</code></li></ul>
+<p>给定一个包含非负整数的 <code><em>m</em> x <em>n</em></code> 网格 <code>grid</code> ，请找出一条从左上角到右下角的路径，使得路径上的数字总和为最小。</p><p><strong>说明：</strong>每次只能向下或者向右移动一步。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/0c6d9496445c66b255a406ba2f9a3eb9.jpeg" style="width: 242px; height: 242px;" /><pre><strong>输入：</strong>grid = [[1,3,1],[1,5,1],[4,2,1]]<strong><br />输出：</strong>7<strong><br />解释：</strong>因为路径 1→3→1→1→1 的总和最小。</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>grid = [[1,2,3],[4,5,6]]<strong><br />输出：</strong>12</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>m == grid.length</code></li>	<li><code>n == grid[i].length</code></li>	<li><code>1 <= m, n <= 200</code></li>	<li><code>0 <= grid[i][j] <= 100</code></li></ul>
 
 以下程序实现了这一功能，请你填补空白处内容：
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/67.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/67.exercises/solution.md"
index 099365eb8..550feb644 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/67.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/67.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 删除链表的倒数第 N 个结点
 
-<p>给你一个链表，删除链表的倒数第 <code>n</code><em> </em>个结点，并且返回链表的头结点。</p><p><strong>进阶：</strong>你能尝试使用一趟扫描实现吗？</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0019.Remove%20Nth%20Node%20From%20End%20of%20List/images/remove_ex1.jpg" style="width: 542px; height: 222px;" /><pre><strong>输入：</strong>head = [1,2,3,4,5], n = 2<strong><br />输出：</strong>[1,2,3,5]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>head = [1], n = 1<strong><br />输出：</strong>[]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>head = [1,2], n = 1<strong><br />输出：</strong>[1]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中结点的数目为 <code>sz</code></li>	<li><code>1 <= sz <= 30</code></li>	<li><code>0 <= Node.val <= 100</code></li>	<li><code>1 <= n <= sz</code></li></ul>
+<p>给你一个链表，删除链表的倒数第 <code>n</code><em> </em>个结点，并且返回链表的头结点。</p><p><strong>进阶：</strong>你能尝试使用一趟扫描实现吗？</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/3ab1d7132da7283b4578c8df78c8fb67.jpeg" style="width: 542px; height: 222px;" /><pre><strong>输入：</strong>head = [1,2,3,4,5], n = 2<strong><br />输出：</strong>[1,2,3,5]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>head = [1], n = 1<strong><br />输出：</strong>[]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>head = [1,2], n = 1<strong><br />输出：</strong>[1]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中结点的数目为 <code>sz</code></li>	<li><code>1 <= sz <= 30</code></li>	<li><code>0 <= Node.val <= 100</code></li>	<li><code>1 <= n <= sz</code></li></ul>
 
 以下程序实现了这一功能，请你填补空白处内容：
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/72.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/72.exercises/solution.md"
index d2ede5a0c..4707d848f 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/72.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/72.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 交错字符串
 
-<p>给定三个字符串 <code>s1</code>、<code>s2</code>、<code>s3</code>，请你帮忙验证 <code>s3</code> 是否是由 <code>s1</code> 和 <code>s2</code><em> </em><strong>交错 </strong>组成的。</p><p>两个字符串 <code>s</code> 和 <code>t</code> <strong>交错</strong> 的定义与过程如下，其中每个字符串都会被分割成若干 <strong>非空</strong> 子字符串：</p><ul>	<li><code>s = s<sub>1</sub> + s<sub>2</sub> + ... + s<sub>n</sub></code></li>	<li><code>t = t<sub>1</sub> + t<sub>2</sub> + ... + t<sub>m</sub></code></li>	<li><code>|n - m| <= 1</code></li>	<li><strong>交错</strong> 是 <code>s<sub>1</sub> + t<sub>1</sub> + s<sub>2</sub> + t<sub>2</sub> + s<sub>3</sub> + t<sub>3</sub> + ...</code> 或者 <code>t<sub>1</sub> + s<sub>1</sub> + t<sub>2</sub> + s<sub>2</sub> + t<sub>3</sub> + s<sub>3</sub> + ...</code></li></ul><p><strong>提示：</strong><code>a + b</code> 意味着字符串 <code>a</code> 和 <code>b</code> 连接。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0097.Interleaving%20String/images/interleave.jpg" style="width: 561px; height: 203px;" /><pre><strong>输入：</strong>s1 = "aabcc", s2 = "dbbca", s3 = "aadbbcbcac"<strong><br />输出：</strong>true</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>s1 = "aabcc", s2 = "dbbca", s3 = "aadbbbaccc"<strong><br />输出：</strong>false</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>s1 = "", s2 = "", s3 = ""<strong><br />输出：</strong>true</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>0 <= s1.length, s2.length <= 100</code></li>	<li><code>0 <= s3.length <= 200</code></li>	<li><code>s1</code>、<code>s2</code>、和 <code>s3</code> 都由小写英文字母组成</li></ul>
+<p>给定三个字符串 <code>s1</code>、<code>s2</code>、<code>s3</code>，请你帮忙验证 <code>s3</code> 是否是由 <code>s1</code> 和 <code>s2</code><em> </em><strong>交错 </strong>组成的。</p><p>两个字符串 <code>s</code> 和 <code>t</code> <strong>交错</strong> 的定义与过程如下，其中每个字符串都会被分割成若干 <strong>非空</strong> 子字符串：</p><ul>	<li><code>s = s<sub>1</sub> + s<sub>2</sub> + ... + s<sub>n</sub></code></li>	<li><code>t = t<sub>1</sub> + t<sub>2</sub> + ... + t<sub>m</sub></code></li>	<li><code>|n - m| <= 1</code></li>	<li><strong>交错</strong> 是 <code>s<sub>1</sub> + t<sub>1</sub> + s<sub>2</sub> + t<sub>2</sub> + s<sub>3</sub> + t<sub>3</sub> + ...</code> 或者 <code>t<sub>1</sub> + s<sub>1</sub> + t<sub>2</sub> + s<sub>2</sub> + t<sub>3</sub> + s<sub>3</sub> + ...</code></li></ul><p><strong>提示：</strong><code>a + b</code> 意味着字符串 <code>a</code> 和 <code>b</code> 连接。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/d01d6f6906b7777c9823a97e68b77d06.jpeg" style="width: 561px; height: 203px;" /><pre><strong>输入：</strong>s1 = "aabcc", s2 = "dbbca", s3 = "aadbbcbcac"<strong><br />输出：</strong>true</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>s1 = "aabcc", s2 = "dbbca", s3 = "aadbbbaccc"<strong><br />输出：</strong>false</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>s1 = "", s2 = "", s3 = ""<strong><br />输出：</strong>true</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>0 <= s1.length, s2.length <= 100</code></li>	<li><code>0 <= s3.length <= 200</code></li>	<li><code>s1</code>、<code>s2</code>、和 <code>s3</code> 都由小写英文字母组成</li></ul>
 
 以下程序实现了这一功能，请你填补空白处内容：
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/78.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/78.exercises/solution.md"
index 5480fc78d..02dd33c47 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/78.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/78.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 单词搜索
 
-<p>给定一个 <code>m x n</code> 二维字符网格 <code>board</code> 和一个字符串单词 <code>word</code> 。如果 <code>word</code> 存在于网格中，返回 <code>true</code> ；否则，返回 <code>false</code> 。</p><p>单词必须按照字母顺序，通过相邻的单元格内的字母构成，其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母不允许被重复使用。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0079.Word%20Search/images/word2.jpg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCCED"<strong><br />输出：</strong>true</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0079.Word%20Search/images/word-1.jpg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "SEE"<strong><br />输出：</strong>true</pre><p><strong>示例 3：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0079.Word%20Search/images/word3.jpg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCB"<strong><br />输出：</strong>false</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>m == board.length</code></li>	<li><code>n = board[i].length</code></li>	<li><code>1 <= m, n <= 6</code></li>	<li><code>1 <= word.length <= 15</code></li>	<li><code>board</code> 和 <code>word</code> 仅由大小写英文字母组成</li></ul><p> </p><p><strong>进阶：</strong>你可以使用搜索剪枝的技术来优化解决方案，使其在 <code>board</code> 更大的情况下可以更快解决问题？</p>
+<p>给定一个 <code>m x n</code> 二维字符网格 <code>board</code> 和一个字符串单词 <code>word</code> 。如果 <code>word</code> 存在于网格中，返回 <code>true</code> ；否则，返回 <code>false</code> 。</p><p>单词必须按照字母顺序，通过相邻的单元格内的字母构成，其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母不允许被重复使用。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/d41f067a92645388770d389f5e4d7269.jpeg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCCED"<strong><br />输出：</strong>true</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/56b7681c631f1e73b77fe9a7475033ea.jpeg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "SEE"<strong><br />输出：</strong>true</pre><p><strong>示例 3：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/58c1e99e8c54dfb7496d44f2d05c8e96.jpeg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCB"<strong><br />输出：</strong>false</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>m == board.length</code></li>	<li><code>n = board[i].length</code></li>	<li><code>1 <= m, n <= 6</code></li>	<li><code>1 <= word.length <= 15</code></li>	<li><code>board</code> 和 <code>word</code> 仅由大小写英文字母组成</li></ul><p> </p><p><strong>进阶：</strong>你可以使用搜索剪枝的技术来优化解决方案，使其在 <code>board</code> 更大的情况下可以更快解决问题？</p>
 
 以下程序实现了这一功能，请你填补空白处内容：
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/79.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/79.exercises/solution.md"
index c3dfde0be..f17a85717 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/79.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/79.exercises/solution.md"
@@ -14,13 +14,13 @@
     <p>&nbsp;</p>
 
     <p><strong>示例 1：</strong></p>
-    <img style="width: 302px; height: 182px;" src="https://assets.leetcode.com/uploads/2020/12/01/tree1.jpg" alt="">
+    <img style="width: 302px; height: 182px;" src="https://img-service.csdnimg.cn/img_convert/3d85b39145ecc61874276bcb7cfe6765.jpeg" alt="">
     <pre><strong>输入：</strong>root = [2,1,3]
 <strong>输出：</strong>true
 </pre>
 
     <p><strong>示例 2：</strong></p>
-    <img style="width: 422px; height: 292px;" src="https://assets.leetcode.com/uploads/2020/12/01/tree2.jpg" alt="">
+    <img style="width: 422px; height: 292px;" src="https://img-service.csdnimg.cn/img_convert/f8c9b63a549daf28d19243f8141bb56d.jpeg" alt="">
     <pre><strong>输入：</strong>root = [5,1,4,null,null,3,6]
 <strong>输出：</strong>false
 <strong>解释：</strong>根节点的值是 5 ，但是右子节点的值是 4 。
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/80.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/80.exercises/solution.md"
index 224a97f10..0d3a12cdb 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/80.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/80.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 删除排序链表中的重复元素 II
 
-<p>存在一个按升序排列的链表，给你这个链表的头节点 <code>head</code> ，请你删除链表中所有存在数字重复情况的节点，只保留原始链表中 <strong>没有重复出现</strong><em> </em>的数字。</p><p>返回同样按升序排列的结果链表。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0082.Remove%20Duplicates%20from%20Sorted%20List%20II/images/linkedlist1.jpg" style="width: 500px; height: 142px;" /><pre><strong>输入：</strong>head = [1,2,3,3,4,4,5]<strong><br />输出：</strong>[1,2,5]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0082.Remove%20Duplicates%20from%20Sorted%20List%20II/images/linkedlist2.jpg" style="width: 500px; height: 205px;" /><pre><strong>输入：</strong>head = [1,1,1,2,3]<strong><br />输出：</strong>[2,3]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点数目在范围 <code>[0, 300]</code> 内</li>	<li><code>-100 <= Node.val <= 100</code></li>	<li>题目数据保证链表已经按升序排列</li></ul>
+<p>存在一个按升序排列的链表，给你这个链表的头节点 <code>head</code> ，请你删除链表中所有存在数字重复情况的节点，只保留原始链表中 <strong>没有重复出现</strong><em> </em>的数字。</p><p>返回同样按升序排列的结果链表。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/5b9243e41528c71944e0f9436d8c249f.jpeg" style="width: 500px; height: 142px;" /><pre><strong>输入：</strong>head = [1,2,3,3,4,4,5]<strong><br />输出：</strong>[1,2,5]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/f43c3f1fdb51738ae73ac8543c9b4e9b.jpeg" style="width: 500px; height: 205px;" /><pre><strong>输入：</strong>head = [1,1,1,2,3]<strong><br />输出：</strong>[2,3]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点数目在范围 <code>[0, 300]</code> 内</li>	<li><code>-100 <= Node.val <= 100</code></li>	<li>题目数据保证链表已经按升序排列</li></ul>
 
 以下程序实现了这一功能，请你填补空白处内容：
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/83.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/83.exercises/solution.md"
index aae11a0f0..d99514e45 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/83.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/83.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 螺旋矩阵 II
 
-<p>给你一个正整数 <code>n</code> ，生成一个包含 <code>1</code> 到 <code>n<sup>2</sup></code> 所有元素，且元素按顺时针顺序螺旋排列的 <code>n x n</code> 正方形矩阵 <code>matrix</code> 。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0059.Spiral%20Matrix%20II/images/spiraln.jpg" style="width: 242px; height: 242px;" /><pre><strong>输入：</strong>n = 3<strong><br />输出：</strong>[[1,2,3],[8,9,4],[7,6,5]]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>n = 1<strong><br />输出：</strong>[[1]]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>1 <= n <= 20</code></li></ul>
+<p>给你一个正整数 <code>n</code> ，生成一个包含 <code>1</code> 到 <code>n<sup>2</sup></code> 所有元素，且元素按顺时针顺序螺旋排列的 <code>n x n</code> 正方形矩阵 <code>matrix</code> 。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/b2086bc4a6e47ebbf922fed2e817b298.jpeg" style="width: 242px; height: 242px;" /><pre><strong>输入：</strong>n = 3<strong><br />输出：</strong>[[1,2,3],[8,9,4],[7,6,5]]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>n = 1<strong><br />输出：</strong>[[1]]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>1 <= n <= 20</code></li></ul>
 
 以下程序实现了这一功能，请你填补空白处内容：
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/84.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/84.exercises/solution.md"
index 0919fc2a6..9e7c67a7d 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/84.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/84.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 两两交换链表中的节点
 
-<p>给定一个链表，两两交换其中相邻的节点，并返回交换后的链表。</p><p><strong>你不能只是单纯的改变节点内部的值</strong>，而是需要实际的进行节点交换。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0024.Swap%20Nodes%20in%20Pairs/images/swap_ex1.jpg" style="width: 422px; height: 222px;" /><pre><strong>输入：</strong>head = [1,2,3,4]<strong><br />输出：</strong>[2,1,4,3]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>head = []<strong><br />输出：</strong>[]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>head = [1]<strong><br />输出：</strong>[1]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点的数目在范围 <code>[0, 100]</code> 内</li>	<li><code>0 <= Node.val <= 100</code></li></ul><p> </p><p><strong>进阶：</strong>你能在不修改链表节点值的情况下解决这个问题吗?（也就是说，仅修改节点本身。）</p>
+<p>给定一个链表，两两交换其中相邻的节点，并返回交换后的链表。</p><p><strong>你不能只是单纯的改变节点内部的值</strong>，而是需要实际的进行节点交换。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/88da15e3bf83dfb0c4784dc6700e84bc.jpeg" style="width: 422px; height: 222px;" /><pre><strong>输入：</strong>head = [1,2,3,4]<strong><br />输出：</strong>[2,1,4,3]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>head = []<strong><br />输出：</strong>[]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>head = [1]<strong><br />输出：</strong>[1]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点的数目在范围 <code>[0, 100]</code> 内</li>	<li><code>0 <= Node.val <= 100</code></li></ul><p> </p><p><strong>进阶：</strong>你能在不修改链表节点值的情况下解决这个问题吗?（也就是说，仅修改节点本身。）</p>
 
 以下程序实现了这一功能，请你填补空白处内容：
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/86.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/86.exercises/solution.md"
index 6e68ee522..412965990 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/86.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/86.exercises/solution.md"
@@ -3,16 +3,16 @@
 <p>一个机器人位于一个 <em>m x n </em>网格的左上角 （起始点在下图中标记为“Start” ）。</p>
 <p>机器人每次只能向下或者向右移动一步。机器人试图达到网格的右下角（在下图中标记为“Finish”）。</p>
 <p>现在考虑网格中有障碍物。那么从左上角到右下角将会有多少条不同的路径？</p>
-<p><img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0063.Unique%20Paths%20II/images/robot_maze.png"
+<p><img src="https://img-service.csdnimg.cn/img_convert/dcc604a2757b6fd0e6bdc5155c945ffc.png"
         style="height: 183px; width: 400px;" /></p>
 <p>网格中的障碍物和空位置分别用 <code>1</code> 和 <code>0</code> 来表示。</p>
 <p> </p>
 <p><strong>示例 1：</strong></p><img alt=""
-    src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0063.Unique%20Paths%20II/images/robot1.jpg"
+    src="https://img-service.csdnimg.cn/img_convert/d127c16fad8048e19db6f2a2bea73240.jpeg"
     style="width: 242px; height: 242px;" />
 <pre><strong>输入：</strong>obstacleGrid = [[0,0,0],[0,1,0],[0,0,0]]<strong><br />输出：</strong>2<strong><br />解释：</strong>3x3 网格的正中间有一个障碍物。从左上角到右下角一共有 2 条不同的路径：<br />1. 向右 -> 向右 -> 向下 -> 向下<br />2. 向下 -> 向下 -> 向右 -> 向右</pre>
 <p><strong>示例 2：</strong></p><img alt=""
-    src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0063.Unique%20Paths%20II/images/robot2.jpg"
+    src="https://img-service.csdnimg.cn/img_convert/d95382b3c9b30e83be3e383421106a67.jpeg"
     style="width: 162px; height: 162px;" />
 <pre><strong>输入：</strong>obstacleGrid = [[0,1],[0,0]]<strong><br />输出：</strong>1</pre>
 <p> </p>
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/87.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/87.exercises/solution.md"
index cc9aa5af6..b68dcd4d7 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/87.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/87.exercises/solution.md"
@@ -14,7 +14,7 @@
 </ul>
 <p> </p>
 <p><strong>示例 1：</strong></p><img
-    src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0036.Valid%20Sudoku/images/250px-sudoku-by-l2g-20050714svg.png"
+    src="https://img-service.csdnimg.cn/img_convert/8aed54207b4871a01fb402d8d21a128b.png"
     style="height:250px; width:250px" />
 <pre><strong>输入：</strong>board = 
     [["5","3",".",".","7",".",".",".","."]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/90.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/90.exercises/solution.md"
index 5469faf01..4085bc625 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/90.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/90.exercises/solution.md"
@@ -5,7 +5,7 @@
 <p> </p>
 
 <p><strong>示例 1:</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/tree.jpg" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/3191074cd189469c9d9199a126b6d035.jpeg" />
 <pre>
 <strong>Input:</strong> preorder = [3,9,20,15,7], inorder = [9,3,15,20,7]
 <strong>Output:</strong> [3,9,20,null,null,15,7]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/94.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/94.exercises/solution.md"
index c53bd9dc0..3c5848d88 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/94.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/94.exercises/solution.md"
@@ -9,14 +9,14 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/01/18/pathsumii1.jpg" style="width: 500px; height: 356px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/abdc6911d9d9ee1b12dcdbb1945a1ab2.jpeg" style="width: 500px; height: 356px;" />
 <pre>
 <strong>输入：</strong>root = [5,4,8,11,null,13,4,7,2,null,null,5,1], targetSum = 22
 <strong>输出：</strong>[[5,4,11,2],[5,8,4,5]]
 </pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/01/18/pathsum2.jpg" style="width: 212px; height: 181px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/9bc801134935f549d425954a120f1cc3.jpeg" style="width: 212px; height: 181px;" />
 <pre>
 <strong>输入：</strong>root = [1,2,3], targetSum = 5
 <strong>输出：</strong>[]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/95.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/95.exercises/solution.md"
index dbe68d297..b6a7254d7 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/95.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/95.exercises/solution.md"
@@ -10,7 +10,7 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/01/14/flaten.jpg" style="width: 500px; height: 226px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/92075cab0821ae4b0edf18d3de9db0f1.jpeg" style="width: 500px; height: 226px;" />
 <pre>
 <strong>输入：</strong>root = [1,2,5,3,4,null,6]
 <strong>输出：</strong>[1,null,2,null,3,null,4,null,5,null,6]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/96.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/96.exercises/solution.md"
index 403d34145..c304ffdb7 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/96.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/96.exercises/solution.md"
@@ -27,7 +27,7 @@ struct Node {
 
 <p><strong>示例：</strong></p>
 
-<p><img alt="" src="https://assets.leetcode.com/uploads/2019/02/14/116_sample.png" style="height: 205px; width: 600px;" /></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/27903dce19b8e06520fe489475e37ae7.png" style="height: 205px; width: 600px;" /></p>
 
 <pre>
 <b>输入：</b>root = [1,2,3,4,5,6,7]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/97.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/97.exercises/solution.md"
index d37f6b23b..f0480fcae 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/97.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/97.exercises/solution.md"
@@ -27,7 +27,7 @@ struct Node {
 
 <p><strong>示例：</strong></p>
 
-<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2019/02/15/117_sample.png" style="height: 218px; width: 640px;" /></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/a5d95fc158b54c265e39bd7e6183494d.png" style="height: 218px; width: 640px;" /></p>
 
 <pre>
 <strong>输入</strong>：root = [1,2,3,4,5,null,7]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/10.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/10.exercises/solution.md"
index 9b117f71f..b01d3dad5 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/10.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/10.exercises/solution.md"
@@ -11,7 +11,7 @@
         <div>
             <p><strong>示例 1：</strong></p>
             <img style="width: 600px; height: 148px;"
-                src="https://assets.leetcode.com/uploads/2021/01/18/uniquebstn3.jpg" alt="">
+                src="https://img-service.csdnimg.cn/img_convert/afa8711beb3c6f3c54d039379f525fb7.jpeg" alt="">
             <pre><strong>输入：</strong>n = 3
 <strong>输出：</strong>[[1,null,2,null,3],[1,null,3,2],[2,1,3],[3,1,null,null,2],[3,2,null,1]]
     </pre>
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/102.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/102.exercises/solution.md"
index 0f1f99f00..264aec42c 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/102.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/102.exercises/solution.md"
@@ -6,7 +6,7 @@
 
 <p><strong>示例 1:</strong></p>
 
-<p><img src="https://assets.leetcode.com/uploads/2021/02/14/tree.jpg" style="width: 270px; " /></p>
+<p><img src="https://img-service.csdnimg.cn/img_convert/d8e254ac37a1738da124338966297a76.jpeg" style="width: 270px; " /></p>
 
 <pre>
 <strong>输入:</strong> [1,2,3,null,5,null,4]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/12.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/12.exercises/solution.md"
index 474f9ab1e..b968d5d8b 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/12.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/12.exercises/solution.md"
@@ -7,7 +7,7 @@
     <p>&nbsp;</p>
 
     <p><strong>示例 1：</strong></p>
-    <img style="width: 600px; height: 148px;" src="https://assets.leetcode.com/uploads/2021/01/18/uniquebstn3.jpg"
+    <img style="width: 600px; height: 148px;" src="https://img-service.csdnimg.cn/img_convert/afa8711beb3c6f3c54d039379f525fb7.jpeg"
         alt="">
     <pre><strong>输入：</strong>n = 3
 <strong>输出：</strong>5
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/15.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/15.exercises/solution.md"
index 4bb94f2ad..0eeaa3483 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/15.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/15.exercises/solution.md"
@@ -32,7 +32,7 @@
 
     <p>例如，数字字符串 <code>"3322251"</code> 的描述如下图：</p>
     <img alt=""
-        src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0038.Count%20and%20Say/images/countandsay.jpg"
+        src="https://img-service.csdnimg.cn/img_convert/23bfeaec5ed390ee12e4ab4f6bd7da5a.jpeg"
         style="width: 581px; height: 172px;" />
     <ul>
     </ul>
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/16.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/16.exercises/solution.md"
index 3556c4f6a..2f89083ad 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/16.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/16.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 旋转链表
 
-<p>给你一个链表的头节点 <code>head</code> ，旋转链表，将链表每个节点向右移动 <code>k</code><em> </em>个位置。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0061.Rotate%20List/images/rotate1.jpg" style="width: 600px; height: 254px;" /><pre><strong>输入：</strong>head = [1,2,3,4,5], k = 2<strong><br />输出：</strong>[4,5,1,2,3]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0061.Rotate%20List/images/roate2.jpg" style="width: 472px; height: 542px;" /><pre><strong>输入：</strong>head = [0,1,2], k = 4<strong><br />输出：</strong>[2,0,1]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点的数目在范围 <code>[0, 500]</code> 内</li>	<li><code>-100 <= Node.val <= 100</code></li>	<li><code>0 <= k <= 2 * 10<sup>9</sup></code></li></ul>
+<p>给你一个链表的头节点 <code>head</code> ，旋转链表，将链表每个节点向右移动 <code>k</code><em> </em>个位置。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/c0d8ae472058ab78d44488d3d18b7d34.jpeg" style="width: 600px; height: 254px;" /><pre><strong>输入：</strong>head = [1,2,3,4,5], k = 2<strong><br />输出：</strong>[4,5,1,2,3]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/b36376b20ad1074341ffc8bca9a32eca.jpeg" style="width: 472px; height: 542px;" /><pre><strong>输入：</strong>head = [0,1,2], k = 4<strong><br />输出：</strong>[2,0,1]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点的数目在范围 <code>[0, 500]</code> 内</li>	<li><code>-100 <= Node.val <= 100</code></li>	<li><code>0 <= k <= 2 * 10<sup>9</sup></code></li></ul>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/19.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/19.exercises/solution.md"
index ede72f621..ffc8d6b51 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/19.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/19.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 旋转图像
 
-<p>给定一个 <em>n </em>× <em>n</em> 的二维矩阵 <code>matrix</code> 表示一个图像。请你将图像顺时针旋转 90 度。</p><p>你必须在<strong><a href="https://baike.baidu.com/item/%E5%8E%9F%E5%9C%B0%E7%AE%97%E6%B3%95" target="_blank"> 原地</a></strong> 旋转图像，这意味着你需要直接修改输入的二维矩阵。<strong>请不要 </strong>使用另一个矩阵来旋转图像。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0048.Rotate%20Image/images/mat1.jpg" style="width: 642px; height: 242px;" /><pre><strong>输入：</strong>matrix = [[1,2,3],[4,5,6],[7,8,9]]<strong><br />输出：</strong>[[7,4,1],[8,5,2],[9,6,3]]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0048.Rotate%20Image/images/mat2.jpg" style="width: 800px; height: 321px;" /><pre><strong>输入：</strong>matrix = [[5,1,9,11],[2,4,8,10],[13,3,6,7],[15,14,12,16]]<strong><br />输出：</strong>[[15,13,2,5],[14,3,4,1],[12,6,8,9],[16,7,10,11]]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>matrix = [[1]]<strong><br />输出：</strong>[[1]]</pre><p><strong>示例 4：</strong></p><pre><strong>输入：</strong>matrix = [[1,2],[3,4]]<strong><br />输出：</strong>[[3,1],[4,2]]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>matrix.length == n</code></li>	<li><code>matrix[i].length == n</code></li>	<li><code>1 <= n <= 20</code></li>	<li><code>-1000 <= matrix[i][j] <= 1000</code></li></ul>
+<p>给定一个 <em>n </em>× <em>n</em> 的二维矩阵 <code>matrix</code> 表示一个图像。请你将图像顺时针旋转 90 度。</p><p>你必须在<strong><a href="https://baike.baidu.com/item/%E5%8E%9F%E5%9C%B0%E7%AE%97%E6%B3%95" target="_blank"> 原地</a></strong> 旋转图像，这意味着你需要直接修改输入的二维矩阵。<strong>请不要 </strong>使用另一个矩阵来旋转图像。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/9a815a9eeb64d633de1bcd8d864f069d.jpeg" style="width: 642px; height: 242px;" /><pre><strong>输入：</strong>matrix = [[1,2,3],[4,5,6],[7,8,9]]<strong><br />输出：</strong>[[7,4,1],[8,5,2],[9,6,3]]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/5f637f84287da51eb330d2128bfb306f.jpeg" style="width: 800px; height: 321px;" /><pre><strong>输入：</strong>matrix = [[5,1,9,11],[2,4,8,10],[13,3,6,7],[15,14,12,16]]<strong><br />输出：</strong>[[15,13,2,5],[14,3,4,1],[12,6,8,9],[16,7,10,11]]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>matrix = [[1]]<strong><br />输出：</strong>[[1]]</pre><p><strong>示例 4：</strong></p><pre><strong>输入：</strong>matrix = [[1,2],[3,4]]<strong><br />输出：</strong>[[3,1],[4,2]]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>matrix.length == n</code></li>	<li><code>matrix[i].length == n</code></li>	<li><code>1 <= n <= 20</code></li>	<li><code>-1000 <= matrix[i][j] <= 1000</code></li></ul>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/20.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/20.exercises/solution.md"
index 4cdb67df8..62e6976c5 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/20.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/20.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 盛最多水的容器
 
-<p>给你 <code>n</code> 个非负整数 <code>a<sub>1</sub>，a<sub>2，</sub>...，a</code><sub><code>n</code>，</sub>每个数代表坐标中的一个点 <code>(i, a<sub>i</sub>)</code> 。在坐标内画 <code>n</code> 条垂直线，垂直线 <code>i</code> 的两个端点分别为 <code>(i, a<sub>i</sub>)</code> 和 <code>(i, 0)</code> 。找出其中的两条线，使得它们与 <code>x</code> 轴共同构成的容器可以容纳最多的水。</p><p><strong>说明：</strong>你不能倾斜容器。</p><p> </p><p><strong>示例 1：</strong></p><p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0011.Container%20With%20Most%20Water/images/question_11.jpg" style="height: 287px; width: 600px;" /></p><pre><strong>输入：</strong>[1,8,6,2,5,4,8,3,7]<strong><br />输出：</strong>49 <strong><br />解释：</strong>图中垂直线代表输入数组 [1,8,6,2,5,4,8,3,7]。在此情况下，容器能够容纳水（表示为蓝色部分）的最大值为 49。</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>height = [1,1]<strong><br />输出：</strong>1</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>height = [4,3,2,1,4]<strong><br />输出：</strong>16</pre><p><strong>示例 4：</strong></p><pre><strong>输入：</strong>height = [1,2,1]<strong><br />输出：</strong>2</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>n = height.length</code></li>	<li><code>2 <= n <= 3 * 10<sup>4</sup></code></li>	<li><code>0 <= height[i] <= 3 * 10<sup>4</sup></code></li></ul>
+<p>给你 <code>n</code> 个非负整数 <code>a<sub>1</sub>，a<sub>2，</sub>...，a</code><sub><code>n</code>，</sub>每个数代表坐标中的一个点 <code>(i, a<sub>i</sub>)</code> 。在坐标内画 <code>n</code> 条垂直线，垂直线 <code>i</code> 的两个端点分别为 <code>(i, a<sub>i</sub>)</code> 和 <code>(i, 0)</code> 。找出其中的两条线，使得它们与 <code>x</code> 轴共同构成的容器可以容纳最多的水。</p><p><strong>说明：</strong>你不能倾斜容器。</p><p> </p><p><strong>示例 1：</strong></p><p><img alt="" src="https://img-service.csdnimg.cn/img_convert/68b73af992268f52fa1d1edf7891fcc2.jpeg" style="height: 287px; width: 600px;" /></p><pre><strong>输入：</strong>[1,8,6,2,5,4,8,3,7]<strong><br />输出：</strong>49 <strong><br />解释：</strong>图中垂直线代表输入数组 [1,8,6,2,5,4,8,3,7]。在此情况下，容器能够容纳水（表示为蓝色部分）的最大值为 49。</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>height = [1,1]<strong><br />输出：</strong>1</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>height = [4,3,2,1,4]<strong><br />输出：</strong>16</pre><p><strong>示例 4：</strong></p><pre><strong>输入：</strong>height = [1,2,1]<strong><br />输出：</strong>2</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>n = height.length</code></li>	<li><code>2 <= n <= 3 * 10<sup>4</sup></code></li>	<li><code>0 <= height[i] <= 3 * 10<sup>4</sup></code></li></ul>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/26.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/26.exercises/solution.md"
index 37d5cfd58..4030a358f 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/26.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/26.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 两数相加
 
-<p>给你两个 <strong>非空</strong> 的链表，表示两个非负的整数。它们每位数字都是按照 <strong>逆序</strong> 的方式存储的，并且每个节点只能存储 <strong>一位</strong> 数字。</p><p>请你将两个数相加，并以相同形式返回一个表示和的链表。</p><p>你可以假设除了数字 0 之外，这两个数都不会以 0 开头。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0002.Add%20Two%20Numbers/images/addtwonumber1.jpg" style="width: 483px; height: 342px;" /><pre><strong>输入：</strong>l1 = [2,4,3], l2 = [5,6,4]<strong><br />输出：</strong>[7,0,8]<strong><br />解释：</strong>342 + 465 = 807.</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>l1 = [0], l2 = [0]<strong><br />输出：</strong>[0]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]<strong><br />输出：</strong>[8,9,9,9,0,0,0,1]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>每个链表中的节点数在范围 <code>[1, 100]</code> 内</li>	<li><code>0 <= Node.val <= 9</code></li>	<li>题目数据保证列表表示的数字不含前导零</li></ul>
+<p>给你两个 <strong>非空</strong> 的链表，表示两个非负的整数。它们每位数字都是按照 <strong>逆序</strong> 的方式存储的，并且每个节点只能存储 <strong>一位</strong> 数字。</p><p>请你将两个数相加，并以相同形式返回一个表示和的链表。</p><p>你可以假设除了数字 0 之外，这两个数都不会以 0 开头。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/3d2b007db4e6d4c6b2b5ec03d67f97e0.jpeg" style="width: 483px; height: 342px;" /><pre><strong>输入：</strong>l1 = [2,4,3], l2 = [5,6,4]<strong><br />输出：</strong>[7,0,8]<strong><br />解释：</strong>342 + 465 = 807.</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>l1 = [0], l2 = [0]<strong><br />输出：</strong>[0]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]<strong><br />输出：</strong>[8,9,9,9,0,0,0,1]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>每个链表中的节点数在范围 <code>[1, 100]</code> 内</li>	<li><code>0 <= Node.val <= 9</code></li>	<li>题目数据保证列表表示的数字不含前导零</li></ul>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/27.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/27.exercises/solution.md"
index 05aca400d..6e6c97ccd 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/27.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/27.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 分隔链表
 
-<p>给你一个链表的头节点 <code>head</code> 和一个特定值<em> </em><code>x</code> ，请你对链表进行分隔，使得所有 <strong>小于</strong> <code>x</code> 的节点都出现在 <strong>大于或等于</strong> <code>x</code> 的节点之前。</p><p>你应当 <strong>保留</strong> 两个分区中每个节点的初始相对位置。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0086.Partition%20List/images/partition.jpg" style="width: 662px; height: 222px;" /><pre><strong>输入：</strong>head = [1,4,3,2,5,2], x = 3<strong><br />输出</strong>：[1,2,2,4,3,5]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>head = [2,1], x = 2<strong><br />输出</strong>：[1,2]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点的数目在范围 <code>[0, 200]</code> 内</li>	<li><code>-100 <= Node.val <= 100</code></li>	<li><code>-200 <= x <= 200</code></li></ul>
+<p>给你一个链表的头节点 <code>head</code> 和一个特定值<em> </em><code>x</code> ，请你对链表进行分隔，使得所有 <strong>小于</strong> <code>x</code> 的节点都出现在 <strong>大于或等于</strong> <code>x</code> 的节点之前。</p><p>你应当 <strong>保留</strong> 两个分区中每个节点的初始相对位置。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/54f1177fe2cc4fddce6e1a5553659bee.jpeg" style="width: 662px; height: 222px;" /><pre><strong>输入：</strong>head = [1,4,3,2,5,2], x = 3<strong><br />输出</strong>：[1,2,2,4,3,5]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>head = [2,1], x = 2<strong><br />输出</strong>：[1,2]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点的数目在范围 <code>[0, 200]</code> 内</li>	<li><code>-100 <= Node.val <= 100</code></li>	<li><code>-200 <= x <= 200</code></li></ul>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/33.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/33.exercises/solution.md"
index 2d3308831..b8b5cfa68 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/33.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/33.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 螺旋矩阵
 
-<p>给你一个 <code>m</code> 行 <code>n</code> 列的矩阵 <code>matrix</code> ，请按照 <strong>顺时针螺旋顺序</strong> ，返回矩阵中的所有元素。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0054.Spiral%20Matrix/images/spiral1.jpg" style="width: 242px; height: 242px;" /><pre><strong>输入：</strong>matrix = [[1,2,3],[4,5,6],[7,8,9]]<strong><br />输出：</strong>[1,2,3,6,9,8,7,4,5]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0054.Spiral%20Matrix/images/spiral.jpg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]]<strong><br />输出：</strong>[1,2,3,4,8,12,11,10,9,5,6,7]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>m == matrix.length</code></li>	<li><code>n == matrix[i].length</code></li>	<li><code>1 <= m, n <= 10</code></li>	<li><code>-100 <= matrix[i][j] <= 100</code></li></ul>
+<p>给你一个 <code>m</code> 行 <code>n</code> 列的矩阵 <code>matrix</code> ，请按照 <strong>顺时针螺旋顺序</strong> ，返回矩阵中的所有元素。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/0d476dcc094b85563f4f43c393ef1425.jpeg" style="width: 242px; height: 242px;" /><pre><strong>输入：</strong>matrix = [[1,2,3],[4,5,6],[7,8,9]]<strong><br />输出：</strong>[1,2,3,6,9,8,7,4,5]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/1c83ff2d8f7cc194b08715bacdedff99.jpeg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]]<strong><br />输出：</strong>[1,2,3,4,8,12,11,10,9,5,6,7]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>m == matrix.length</code></li>	<li><code>n == matrix[i].length</code></li>	<li><code>1 <= m, n <= 10</code></li>	<li><code>-100 <= matrix[i][j] <= 100</code></li></ul>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/36.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/36.exercises/solution.md"
index f7994d804..98e1f9105 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/36.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/36.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 搜索二维矩阵
 
-<p>编写一个高效的算法来判断 <code>m x n</code> 矩阵中，是否存在一个目标值。该矩阵具有如下特性：</p><ul>	<li>每行中的整数从左到右按升序排列。</li>	<li>每行的第一个整数大于前一行的最后一个整数。</li></ul><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0074.Search%20a%202D%20Matrix/images/mat.jpg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 3<strong><br />输出：</strong>true</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0074.Search%20a%202D%20Matrix/images/mat2.jpg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 13<strong><br />输出：</strong>false</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>m == matrix.length</code></li>	<li><code>n == matrix[i].length</code></li>	<li><code>1 <= m, n <= 100</code></li>	<li><code>-10<sup>4</sup> <= matrix[i][j], target <= 10<sup>4</sup></code></li></ul>
+<p>编写一个高效的算法来判断 <code>m x n</code> 矩阵中，是否存在一个目标值。该矩阵具有如下特性：</p><ul>	<li>每行中的整数从左到右按升序排列。</li>	<li>每行的第一个整数大于前一行的最后一个整数。</li></ul><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/eb4ca0d861f87843d6d732b4525b0acc.jpeg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 3<strong><br />输出：</strong>true</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/f22033e9dda21437197f5e414c912a3d.jpeg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 13<strong><br />输出：</strong>false</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>m == matrix.length</code></li>	<li><code>n == matrix[i].length</code></li>	<li><code>1 <= m, n <= 100</code></li>	<li><code>-10<sup>4</sup> <= matrix[i][j], target <= 10<sup>4</sup></code></li></ul>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/39.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/39.exercises/solution.md"
index 5782ce2cb..6e07b2a0e 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/39.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/39.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 矩阵置零
 
-<p>给定一个 <code><em>m</em> x <em>n</em></code> 的矩阵，如果一个元素为 <strong>0 </strong>，则将其所在行和列的所有元素都设为 <strong>0</strong> 。请使用 <strong><a href="http://baike.baidu.com/item/%E5%8E%9F%E5%9C%B0%E7%AE%97%E6%B3%95" target="_blank">原地</a></strong> 算法<strong>。</strong></p><p><strong>进阶：</strong></p><ul>	<li>一个直观的解决方案是使用  <code>O(<em>m</em><em>n</em>)</code> 的额外空间，但这并不是一个好的解决方案。</li>	<li>一个简单的改进方案是使用 <code>O(<em>m</em> + <em>n</em>)</code> 的额外空间，但这仍然不是最好的解决方案。</li>	<li>你能想出一个仅使用常量空间的解决方案吗？</li></ul><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0073.Set%20Matrix%20Zeroes/images/mat1.jpg" style="width: 450px; height: 169px;" /><pre><strong>输入：</strong>matrix = [[1,1,1],[1,0,1],[1,1,1]]<strong><br />输出：</strong>[[1,0,1],[0,0,0],[1,0,1]]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0073.Set%20Matrix%20Zeroes/images/mat2.jpg" style="width: 450px; height: 137px;" /><pre><strong>输入：</strong>matrix = [[0,1,2,0],[3,4,5,2],[1,3,1,5]]<strong><br />输出：</strong>[[0,0,0,0],[0,4,5,0],[0,3,1,0]]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>m == matrix.length</code></li>	<li><code>n == matrix[0].length</code></li>	<li><code>1 <= m, n <= 200</code></li>	<li><code>-2<sup>31</sup> <= matrix[i][j] <= 2<sup>31</sup> - 1</code></li></ul>
+<p>给定一个 <code><em>m</em> x <em>n</em></code> 的矩阵，如果一个元素为 <strong>0 </strong>，则将其所在行和列的所有元素都设为 <strong>0</strong> 。请使用 <strong><a href="http://baike.baidu.com/item/%E5%8E%9F%E5%9C%B0%E7%AE%97%E6%B3%95" target="_blank">原地</a></strong> 算法<strong>。</strong></p><p><strong>进阶：</strong></p><ul>	<li>一个直观的解决方案是使用  <code>O(<em>m</em><em>n</em>)</code> 的额外空间，但这并不是一个好的解决方案。</li>	<li>一个简单的改进方案是使用 <code>O(<em>m</em> + <em>n</em>)</code> 的额外空间，但这仍然不是最好的解决方案。</li>	<li>你能想出一个仅使用常量空间的解决方案吗？</li></ul><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/a9dfa884d1a855d6630087aa890a20f8.jpeg" style="width: 450px; height: 169px;" /><pre><strong>输入：</strong>matrix = [[1,1,1],[1,0,1],[1,1,1]]<strong><br />输出：</strong>[[1,0,1],[0,0,0],[1,0,1]]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/816bcf700b7a5b0c1b118f9aaac5bb58.jpeg" style="width: 450px; height: 137px;" /><pre><strong>输入：</strong>matrix = [[0,1,2,0],[3,4,5,2],[1,3,1,5]]<strong><br />输出：</strong>[[0,0,0,0],[0,4,5,0],[0,3,1,0]]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>m == matrix.length</code></li>	<li><code>n == matrix[0].length</code></li>	<li><code>1 <= m, n <= 200</code></li>	<li><code>-2<sup>31</sup> <= matrix[i][j] <= 2<sup>31</sup> - 1</code></li></ul>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/42.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/42.exercises/solution.md"
index f29396a8c..9651d6269 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/42.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/42.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 反转链表 II
 
-给你单链表的头指针 <code>head</code> 和两个整数 <code>left</code> 和 <code>right</code> ，其中 <code>left <= right</code> 。请你反转从位置 <code>left</code> 到位置 <code>right</code> 的链表节点，返回 <strong>反转后的链表</strong> 。<p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0092.Reverse%20Linked%20List%20II/images/rev2ex2.jpg" style="width: 542px; height: 222px;" /><pre><strong>输入：</strong>head = [1,2,3,4,5], left = 2, right = 4<strong><br />输出：</strong>[1,4,3,2,5]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>head = [5], left = 1, right = 1<strong><br />输出：</strong>[5]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点数目为 <code>n</code></li>	<li><code>1 <= n <= 500</code></li>	<li><code>-500 <= Node.val <= 500</code></li>	<li><code>1 <= left <= right <= n</code></li></ul><p> </p><p><strong>进阶：</strong> 你可以使用一趟扫描完成反转吗？</p>
+给你单链表的头指针 <code>head</code> 和两个整数 <code>left</code> 和 <code>right</code> ，其中 <code>left <= right</code> 。请你反转从位置 <code>left</code> 到位置 <code>right</code> 的链表节点，返回 <strong>反转后的链表</strong> 。<p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/c664df96e99b9097662307d2e0368322.jpeg" style="width: 542px; height: 222px;" /><pre><strong>输入：</strong>head = [1,2,3,4,5], left = 2, right = 4<strong><br />输出：</strong>[1,4,3,2,5]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>head = [5], left = 1, right = 1<strong><br />输出：</strong>[5]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点数目为 <code>n</code></li>	<li><code>1 <= n <= 500</code></li>	<li><code>-500 <= Node.val <= 500</code></li>	<li><code>1 <= left <= right <= n</code></li></ul><p> </p><p><strong>进阶：</strong> 你可以使用一趟扫描完成反转吗？</p>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/43.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/43.exercises/solution.md"
index 524f0965a..684b9af0a 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/43.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/43.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 最小路径和
 
-<p>给定一个包含非负整数的 <code><em>m</em> x <em>n</em></code> 网格 <code>grid</code> ，请找出一条从左上角到右下角的路径，使得路径上的数字总和为最小。</p><p><strong>说明：</strong>每次只能向下或者向右移动一步。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0064.Minimum%20Path%20Sum/images/minpath.jpg" style="width: 242px; height: 242px;" /><pre><strong>输入：</strong>grid = [[1,3,1],[1,5,1],[4,2,1]]<strong><br />输出：</strong>7<strong><br />解释：</strong>因为路径 1→3→1→1→1 的总和最小。</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>grid = [[1,2,3],[4,5,6]]<strong><br />输出：</strong>12</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>m == grid.length</code></li>	<li><code>n == grid[i].length</code></li>	<li><code>1 <= m, n <= 200</code></li>	<li><code>0 <= grid[i][j] <= 100</code></li></ul>
+<p>给定一个包含非负整数的 <code><em>m</em> x <em>n</em></code> 网格 <code>grid</code> ，请找出一条从左上角到右下角的路径，使得路径上的数字总和为最小。</p><p><strong>说明：</strong>每次只能向下或者向右移动一步。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/0c6d9496445c66b255a406ba2f9a3eb9.jpeg" style="width: 242px; height: 242px;" /><pre><strong>输入：</strong>grid = [[1,3,1],[1,5,1],[4,2,1]]<strong><br />输出：</strong>7<strong><br />解释：</strong>因为路径 1→3→1→1→1 的总和最小。</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>grid = [[1,2,3],[4,5,6]]<strong><br />输出：</strong>12</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>m == grid.length</code></li>	<li><code>n == grid[i].length</code></li>	<li><code>1 <= m, n <= 200</code></li>	<li><code>0 <= grid[i][j] <= 100</code></li></ul>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/44.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/44.exercises/solution.md"
index 28563a1a1..b18c594a6 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/44.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/44.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 删除链表的倒数第 N 个结点
 
-<p>给你一个链表，删除链表的倒数第 <code>n</code><em> </em>个结点，并且返回链表的头结点。</p><p><strong>进阶：</strong>你能尝试使用一趟扫描实现吗？</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0019.Remove%20Nth%20Node%20From%20End%20of%20List/images/remove_ex1.jpg" style="width: 542px; height: 222px;" /><pre><strong>输入：</strong>head = [1,2,3,4,5], n = 2<strong><br />输出：</strong>[1,2,3,5]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>head = [1], n = 1<strong><br />输出：</strong>[]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>head = [1,2], n = 1<strong><br />输出：</strong>[1]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中结点的数目为 <code>sz</code></li>	<li><code>1 <= sz <= 30</code></li>	<li><code>0 <= Node.val <= 100</code></li>	<li><code>1 <= n <= sz</code></li></ul>
+<p>给你一个链表，删除链表的倒数第 <code>n</code><em> </em>个结点，并且返回链表的头结点。</p><p><strong>进阶：</strong>你能尝试使用一趟扫描实现吗？</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/3ab1d7132da7283b4578c8df78c8fb67.jpeg" style="width: 542px; height: 222px;" /><pre><strong>输入：</strong>head = [1,2,3,4,5], n = 2<strong><br />输出：</strong>[1,2,3,5]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>head = [1], n = 1<strong><br />输出：</strong>[]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>head = [1,2], n = 1<strong><br />输出：</strong>[1]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中结点的数目为 <code>sz</code></li>	<li><code>1 <= sz <= 30</code></li>	<li><code>0 <= Node.val <= 100</code></li>	<li><code>1 <= n <= sz</code></li></ul>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/49.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/49.exercises/solution.md"
index 5b10137a9..bf08e616d 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/49.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/49.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 交错字符串
 
-<p>给定三个字符串 <code>s1</code>、<code>s2</code>、<code>s3</code>，请你帮忙验证 <code>s3</code> 是否是由 <code>s1</code> 和 <code>s2</code><em> </em><strong>交错 </strong>组成的。</p><p>两个字符串 <code>s</code> 和 <code>t</code> <strong>交错</strong> 的定义与过程如下，其中每个字符串都会被分割成若干 <strong>非空</strong> 子字符串：</p><ul>	<li><code>s = s<sub>1</sub> + s<sub>2</sub> + ... + s<sub>n</sub></code></li>	<li><code>t = t<sub>1</sub> + t<sub>2</sub> + ... + t<sub>m</sub></code></li>	<li><code>|n - m| <= 1</code></li>	<li><strong>交错</strong> 是 <code>s<sub>1</sub> + t<sub>1</sub> + s<sub>2</sub> + t<sub>2</sub> + s<sub>3</sub> + t<sub>3</sub> + ...</code> 或者 <code>t<sub>1</sub> + s<sub>1</sub> + t<sub>2</sub> + s<sub>2</sub> + t<sub>3</sub> + s<sub>3</sub> + ...</code></li></ul><p><strong>提示：</strong><code>a + b</code> 意味着字符串 <code>a</code> 和 <code>b</code> 连接。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0097.Interleaving%20String/images/interleave.jpg" style="width: 561px; height: 203px;" /><pre><strong>输入：</strong>s1 = "aabcc", s2 = "dbbca", s3 = "aadbbcbcac"<strong><br />输出：</strong>true</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>s1 = "aabcc", s2 = "dbbca", s3 = "aadbbbaccc"<strong><br />输出：</strong>false</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>s1 = "", s2 = "", s3 = ""<strong><br />输出：</strong>true</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>0 <= s1.length, s2.length <= 100</code></li>	<li><code>0 <= s3.length <= 200</code></li>	<li><code>s1</code>、<code>s2</code>、和 <code>s3</code> 都由小写英文字母组成</li></ul>
+<p>给定三个字符串 <code>s1</code>、<code>s2</code>、<code>s3</code>，请你帮忙验证 <code>s3</code> 是否是由 <code>s1</code> 和 <code>s2</code><em> </em><strong>交错 </strong>组成的。</p><p>两个字符串 <code>s</code> 和 <code>t</code> <strong>交错</strong> 的定义与过程如下，其中每个字符串都会被分割成若干 <strong>非空</strong> 子字符串：</p><ul>	<li><code>s = s<sub>1</sub> + s<sub>2</sub> + ... + s<sub>n</sub></code></li>	<li><code>t = t<sub>1</sub> + t<sub>2</sub> + ... + t<sub>m</sub></code></li>	<li><code>|n - m| <= 1</code></li>	<li><strong>交错</strong> 是 <code>s<sub>1</sub> + t<sub>1</sub> + s<sub>2</sub> + t<sub>2</sub> + s<sub>3</sub> + t<sub>3</sub> + ...</code> 或者 <code>t<sub>1</sub> + s<sub>1</sub> + t<sub>2</sub> + s<sub>2</sub> + t<sub>3</sub> + s<sub>3</sub> + ...</code></li></ul><p><strong>提示：</strong><code>a + b</code> 意味着字符串 <code>a</code> 和 <code>b</code> 连接。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/d01d6f6906b7777c9823a97e68b77d06.jpeg" style="width: 561px; height: 203px;" /><pre><strong>输入：</strong>s1 = "aabcc", s2 = "dbbca", s3 = "aadbbcbcac"<strong><br />输出：</strong>true</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>s1 = "aabcc", s2 = "dbbca", s3 = "aadbbbaccc"<strong><br />输出：</strong>false</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>s1 = "", s2 = "", s3 = ""<strong><br />输出：</strong>true</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>0 <= s1.length, s2.length <= 100</code></li>	<li><code>0 <= s3.length <= 200</code></li>	<li><code>s1</code>、<code>s2</code>、和 <code>s3</code> 都由小写英文字母组成</li></ul>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/55.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/55.exercises/solution.md"
index a20d0041a..0a61804d6 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/55.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/55.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 单词搜索
 
-<p>给定一个 <code>m x n</code> 二维字符网格 <code>board</code> 和一个字符串单词 <code>word</code> 。如果 <code>word</code> 存在于网格中，返回 <code>true</code> ；否则，返回 <code>false</code> 。</p><p>单词必须按照字母顺序，通过相邻的单元格内的字母构成，其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母不允许被重复使用。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0079.Word%20Search/images/word2.jpg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCCED"<strong><br />输出：</strong>true</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0079.Word%20Search/images/word-1.jpg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "SEE"<strong><br />输出：</strong>true</pre><p><strong>示例 3：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0079.Word%20Search/images/word3.jpg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCB"<strong><br />输出：</strong>false</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>m == board.length</code></li>	<li><code>n = board[i].length</code></li>	<li><code>1 <= m, n <= 6</code></li>	<li><code>1 <= word.length <= 15</code></li>	<li><code>board</code> 和 <code>word</code> 仅由大小写英文字母组成</li></ul><p> </p><p><strong>进阶：</strong>你可以使用搜索剪枝的技术来优化解决方案，使其在 <code>board</code> 更大的情况下可以更快解决问题？</p>
+<p>给定一个 <code>m x n</code> 二维字符网格 <code>board</code> 和一个字符串单词 <code>word</code> 。如果 <code>word</code> 存在于网格中，返回 <code>true</code> ；否则，返回 <code>false</code> 。</p><p>单词必须按照字母顺序，通过相邻的单元格内的字母构成，其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母不允许被重复使用。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/d41f067a92645388770d389f5e4d7269.jpeg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCCED"<strong><br />输出：</strong>true</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/56b7681c631f1e73b77fe9a7475033ea.jpeg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "SEE"<strong><br />输出：</strong>true</pre><p><strong>示例 3：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/58c1e99e8c54dfb7496d44f2d05c8e96.jpeg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCB"<strong><br />输出：</strong>false</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>m == board.length</code></li>	<li><code>n = board[i].length</code></li>	<li><code>1 <= m, n <= 6</code></li>	<li><code>1 <= word.length <= 15</code></li>	<li><code>board</code> 和 <code>word</code> 仅由大小写英文字母组成</li></ul><p> </p><p><strong>进阶：</strong>你可以使用搜索剪枝的技术来优化解决方案，使其在 <code>board</code> 更大的情况下可以更快解决问题？</p>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/56.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/56.exercises/solution.md"
index fbed40704..56a58d301 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/56.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/56.exercises/solution.md"
@@ -14,13 +14,13 @@
     <p>&nbsp;</p>
 
     <p><strong>示例 1：</strong></p>
-    <img style="width: 302px; height: 182px;" src="https://assets.leetcode.com/uploads/2020/12/01/tree1.jpg" alt="">
+    <img style="width: 302px; height: 182px;" src="https://img-service.csdnimg.cn/img_convert/3d85b39145ecc61874276bcb7cfe6765.jpeg" alt="">
     <pre><strong>输入：</strong>root = [2,1,3]
 <strong>输出：</strong>true
 </pre>
 
     <p><strong>示例 2：</strong></p>
-    <img style="width: 422px; height: 292px;" src="https://assets.leetcode.com/uploads/2020/12/01/tree2.jpg" alt="">
+    <img style="width: 422px; height: 292px;" src="https://img-service.csdnimg.cn/img_convert/f8c9b63a549daf28d19243f8141bb56d.jpeg" alt="">
     <pre><strong>输入：</strong>root = [5,1,4,null,null,3,6]
 <strong>输出：</strong>false
 <strong>解释：</strong>根节点的值是 5 ，但是右子节点的值是 4 。
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/57.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/57.exercises/solution.md"
index 85d2e3daf..44d33467b 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/57.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/57.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 删除排序链表中的重复元素 II
 
-<p>存在一个按升序排列的链表，给你这个链表的头节点 <code>head</code> ，请你删除链表中所有存在数字重复情况的节点，只保留原始链表中 <strong>没有重复出现</strong><em> </em>的数字。</p><p>返回同样按升序排列的结果链表。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0082.Remove%20Duplicates%20from%20Sorted%20List%20II/images/linkedlist1.jpg" style="width: 500px; height: 142px;" /><pre><strong>输入：</strong>head = [1,2,3,3,4,4,5]<strong><br />输出：</strong>[1,2,5]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0082.Remove%20Duplicates%20from%20Sorted%20List%20II/images/linkedlist2.jpg" style="width: 500px; height: 205px;" /><pre><strong>输入：</strong>head = [1,1,1,2,3]<strong><br />输出：</strong>[2,3]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点数目在范围 <code>[0, 300]</code> 内</li>	<li><code>-100 <= Node.val <= 100</code></li>	<li>题目数据保证链表已经按升序排列</li></ul>
+<p>存在一个按升序排列的链表，给你这个链表的头节点 <code>head</code> ，请你删除链表中所有存在数字重复情况的节点，只保留原始链表中 <strong>没有重复出现</strong><em> </em>的数字。</p><p>返回同样按升序排列的结果链表。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/5b9243e41528c71944e0f9436d8c249f.jpeg" style="width: 500px; height: 142px;" /><pre><strong>输入：</strong>head = [1,2,3,3,4,4,5]<strong><br />输出：</strong>[1,2,5]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/f43c3f1fdb51738ae73ac8543c9b4e9b.jpeg" style="width: 500px; height: 205px;" /><pre><strong>输入：</strong>head = [1,1,1,2,3]<strong><br />输出：</strong>[2,3]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点数目在范围 <code>[0, 300]</code> 内</li>	<li><code>-100 <= Node.val <= 100</code></li>	<li>题目数据保证链表已经按升序排列</li></ul>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/6.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/6.exercises/solution.md"
index 6fda3b8f2..5216d9c36 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/6.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/6.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 恢复二叉搜索树
 
-<p>给你二叉搜索树的根节点 <code>root</code> ，该树中的两个节点被错误地交换。请在不改变其结构的情况下，恢复这棵树。</p><p><strong>进阶：</strong>使用 O(<em>n</em>) 空间复杂度的解法很容易实现。你能想出一个只使用常数空间的解决方案吗？</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0099.Recover%20Binary%20Search%20Tree/images/recover1.jpg" style="width: 422px; height: 302px;" /><pre><strong>输入：</strong>root = [1,3,null,null,2]<strong><br />输出：</strong>[3,1,null,null,2]<strong><br />解释：</strong>3 不能是 1 左孩子，因为 3 > 1 。交换 1 和 3 使二叉搜索树有效。</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0099.Recover%20Binary%20Search%20Tree/images/recover2.jpg" style="width: 581px; height: 302px;" /><pre><strong>输入：</strong>root = [3,1,4,null,null,2]<strong><br />输出：</strong>[2,1,4,null,null,3]<strong><br />解释：</strong>2 不能在 3 的右子树中，因为 2 < 3 。交换 2 和 3 使二叉搜索树有效。</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>树上节点的数目在范围 <code>[2, 1000]</code> 内</li>	<li><code>-2<sup>31</sup> <= Node.val <= 2<sup>31</sup> - 1</code></li></ul>
+<p>给你二叉搜索树的根节点 <code>root</code> ，该树中的两个节点被错误地交换。请在不改变其结构的情况下，恢复这棵树。</p><p><strong>进阶：</strong>使用 O(<em>n</em>) 空间复杂度的解法很容易实现。你能想出一个只使用常数空间的解决方案吗？</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/ec4e4b2849cccb75be04428664afb2fc.jpeg" style="width: 422px; height: 302px;" /><pre><strong>输入：</strong>root = [1,3,null,null,2]<strong><br />输出：</strong>[3,1,null,null,2]<strong><br />解释：</strong>3 不能是 1 左孩子，因为 3 > 1 。交换 1 和 3 使二叉搜索树有效。</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/c039bf633cb8b3bfbb70a26e931a4f53.jpeg" style="width: 581px; height: 302px;" /><pre><strong>输入：</strong>root = [3,1,4,null,null,2]<strong><br />输出：</strong>[2,1,4,null,null,3]<strong><br />解释：</strong>2 不能在 3 的右子树中，因为 2 < 3 。交换 2 和 3 使二叉搜索树有效。</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>树上节点的数目在范围 <code>[2, 1000]</code> 内</li>	<li><code>-2<sup>31</sup> <= Node.val <= 2<sup>31</sup> - 1</code></li></ul>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/60.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/60.exercises/solution.md"
index 6a4124332..00e83e415 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/60.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/60.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 螺旋矩阵 II
 
-<p>给你一个正整数 <code>n</code> ，生成一个包含 <code>1</code> 到 <code>n<sup>2</sup></code> 所有元素，且元素按顺时针顺序螺旋排列的 <code>n x n</code> 正方形矩阵 <code>matrix</code> 。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0059.Spiral%20Matrix%20II/images/spiraln.jpg" style="width: 242px; height: 242px;" /><pre><strong>输入：</strong>n = 3<strong><br />输出：</strong>[[1,2,3],[8,9,4],[7,6,5]]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>n = 1<strong><br />输出：</strong>[[1]]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>1 <= n <= 20</code></li></ul>
+<p>给你一个正整数 <code>n</code> ，生成一个包含 <code>1</code> 到 <code>n<sup>2</sup></code> 所有元素，且元素按顺时针顺序螺旋排列的 <code>n x n</code> 正方形矩阵 <code>matrix</code> 。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/b2086bc4a6e47ebbf922fed2e817b298.jpeg" style="width: 242px; height: 242px;" /><pre><strong>输入：</strong>n = 3<strong><br />输出：</strong>[[1,2,3],[8,9,4],[7,6,5]]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>n = 1<strong><br />输出：</strong>[[1]]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>1 <= n <= 20</code></li></ul>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/61.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/61.exercises/solution.md"
index 7d092db76..67edc708f 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/61.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/61.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 两两交换链表中的节点
 
-<p>给定一个链表，两两交换其中相邻的节点，并返回交换后的链表。</p><p><strong>你不能只是单纯的改变节点内部的值</strong>，而是需要实际的进行节点交换。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0024.Swap%20Nodes%20in%20Pairs/images/swap_ex1.jpg" style="width: 422px; height: 222px;" /><pre><strong>输入：</strong>head = [1,2,3,4]<strong><br />输出：</strong>[2,1,4,3]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>head = []<strong><br />输出：</strong>[]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>head = [1]<strong><br />输出：</strong>[1]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点的数目在范围 <code>[0, 100]</code> 内</li>	<li><code>0 <= Node.val <= 100</code></li></ul><p> </p><p><strong>进阶：</strong>你能在不修改链表节点值的情况下解决这个问题吗?（也就是说，仅修改节点本身。）</p>
+<p>给定一个链表，两两交换其中相邻的节点，并返回交换后的链表。</p><p><strong>你不能只是单纯的改变节点内部的值</strong>，而是需要实际的进行节点交换。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/88da15e3bf83dfb0c4784dc6700e84bc.jpeg" style="width: 422px; height: 222px;" /><pre><strong>输入：</strong>head = [1,2,3,4]<strong><br />输出：</strong>[2,1,4,3]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>head = []<strong><br />输出：</strong>[]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>head = [1]<strong><br />输出：</strong>[1]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点的数目在范围 <code>[0, 100]</code> 内</li>	<li><code>0 <= Node.val <= 100</code></li></ul><p> </p><p><strong>进阶：</strong>你能在不修改链表节点值的情况下解决这个问题吗?（也就是说，仅修改节点本身。）</p>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/63.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/63.exercises/solution.md"
index ff9c5c408..3bc21bb07 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/63.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/63.exercises/solution.md"
@@ -3,16 +3,16 @@
 <p>一个机器人位于一个 <em>m x n </em>网格的左上角 （起始点在下图中标记为“Start” ）。</p>
 <p>机器人每次只能向下或者向右移动一步。机器人试图达到网格的右下角（在下图中标记为“Finish”）。</p>
 <p>现在考虑网格中有障碍物。那么从左上角到右下角将会有多少条不同的路径？</p>
-<p><img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0063.Unique%20Paths%20II/images/robot_maze.png"
+<p><img src="https://img-service.csdnimg.cn/img_convert/dcc604a2757b6fd0e6bdc5155c945ffc.png"
         style="height: 183px; width: 400px;" /></p>
 <p>网格中的障碍物和空位置分别用 <code>1</code> 和 <code>0</code> 来表示。</p>
 <p> </p>
 <p><strong>示例 1：</strong></p><img alt=""
-    src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0063.Unique%20Paths%20II/images/robot1.jpg"
+    src="https://img-service.csdnimg.cn/img_convert/d127c16fad8048e19db6f2a2bea73240.jpeg"
     style="width: 242px; height: 242px;" />
 <pre><strong>输入：</strong>obstacleGrid = [[0,0,0],[0,1,0],[0,0,0]]<strong><br />输出：</strong>2<strong><br />解释：</strong>3x3 网格的正中间有一个障碍物。从左上角到右下角一共有 2 条不同的路径：<br />1. 向右 -> 向右 -> 向下 -> 向下<br />2. 向下 -> 向下 -> 向右 -> 向右</pre>
 <p><strong>示例 2：</strong></p><img alt=""
-    src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0063.Unique%20Paths%20II/images/robot2.jpg"
+    src="https://img-service.csdnimg.cn/img_convert/d95382b3c9b30e83be3e383421106a67.jpeg"
     style="width: 162px; height: 162px;" />
 <pre><strong>输入：</strong>obstacleGrid = [[0,1],[0,0]]<strong><br />输出：</strong>1</pre>
 <p> </p>
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/64.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/64.exercises/solution.md"
index 9bfba34f6..78b0937aa 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/64.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/64.exercises/solution.md"
@@ -14,7 +14,7 @@
 </ul>
 <p> </p>
 <p><strong>示例 1：</strong></p><img
-    src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0036.Valid%20Sudoku/images/250px-sudoku-by-l2g-20050714svg.png"
+    src="https://img-service.csdnimg.cn/img_convert/8aed54207b4871a01fb402d8d21a128b.png"
     style="height:250px; width:250px" />
 <pre><strong>输入：</strong>board = 
     [["5","3",".",".","7",".",".",".","."]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/67.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/67.exercises/solution.md"
index 4b44f326f..1170fb62b 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/67.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/67.exercises/solution.md"
@@ -5,7 +5,7 @@
 <p> </p>
 
 <p><strong>示例 1:</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/tree.jpg" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/3191074cd189469c9d9199a126b6d035.jpeg" />
 <pre>
 <strong>Input:</strong> preorder = [3,9,20,15,7], inorder = [9,3,15,20,7]
 <strong>Output:</strong> [3,9,20,null,null,15,7]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/71.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/71.exercises/solution.md"
index f6ae8e888..a21e9e337 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/71.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/71.exercises/solution.md"
@@ -9,14 +9,14 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/01/18/pathsumii1.jpg" style="width: 500px; height: 356px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/abdc6911d9d9ee1b12dcdbb1945a1ab2.jpeg" style="width: 500px; height: 356px;" />
 <pre>
 <strong>输入：</strong>root = [5,4,8,11,null,13,4,7,2,null,null,5,1], targetSum = 22
 <strong>输出：</strong>[[5,4,11,2],[5,8,4,5]]
 </pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/01/18/pathsum2.jpg" style="width: 212px; height: 181px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/9bc801134935f549d425954a120f1cc3.jpeg" style="width: 212px; height: 181px;" />
 <pre>
 <strong>输入：</strong>root = [1,2,3], targetSum = 5
 <strong>输出：</strong>[]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/72.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/72.exercises/solution.md"
index f97441f21..37ed92eac 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/72.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/72.exercises/solution.md"
@@ -10,7 +10,7 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/01/14/flaten.jpg" style="width: 500px; height: 226px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/92075cab0821ae4b0edf18d3de9db0f1.jpeg" style="width: 500px; height: 226px;" />
 <pre>
 <strong>输入：</strong>root = [1,2,5,3,4,null,6]
 <strong>输出：</strong>[1,null,2,null,3,null,4,null,5,null,6]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/73.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/73.exercises/solution.md"
index 8f0423e45..f60bcc68a 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/73.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/73.exercises/solution.md"
@@ -27,7 +27,7 @@ struct Node {
 
 <p><strong>示例：</strong></p>
 
-<p><img alt="" src="https://assets.leetcode.com/uploads/2019/02/14/116_sample.png" style="height: 205px; width: 600px;" /></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/27903dce19b8e06520fe489475e37ae7.png" style="height: 205px; width: 600px;" /></p>
 
 <pre>
 <b>输入：</b>root = [1,2,3,4,5,6,7]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/74.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/74.exercises/solution.md"
index ae2d602a8..378f0b494 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/74.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/74.exercises/solution.md"
@@ -27,7 +27,7 @@ struct Node {
 
 <p><strong>示例：</strong></p>
 
-<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2019/02/15/117_sample.png" style="height: 218px; width: 640px;" /></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/a5d95fc158b54c265e39bd7e6183494d.png" style="height: 218px; width: 640px;" /></p>
 
 <pre>
 <strong>输入</strong>：root = [1,2,3,4,5,null,7]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/77.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/77.exercises/solution.md"
index c65cee1f9..aa7e938e6 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/77.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/77.exercises/solution.md"
@@ -16,7 +16,7 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/num1tree.jpg" style="width: 212px; height: 182px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/c5a171500238f60dc577e49c2a6122ca.jpeg" style="width: 212px; height: 182px;" />
 <pre>
 <strong>输入：</strong>root = [1,2,3]
 <strong>输出：</strong>25
@@ -26,7 +26,7 @@
 因此，数字总和 = 12 + 13 = <code>25</code></pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/num2tree.jpg" style="width: 292px; height: 302px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/3a1c0b2f9917c246eb105ce6c3747969.jpeg" style="width: 292px; height: 302px;" />
 <pre>
 <strong>输入：</strong>root = [4,9,0,5,1]
 <strong>输出：</strong>1026
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/78.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/78.exercises/solution.md"
index 3efc558a4..73ba64be2 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/78.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/78.exercises/solution.md"
@@ -6,7 +6,7 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/xogrid.jpg" style="width: 550px; height: 237px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/5a3a22bfad68fd1d22012a0ee48ec665.jpeg" style="width: 550px; height: 237px;" />
 <pre>
 <strong>输入：</strong>board = [["X","X","X","X"],["X","O","O","X"],["X","X","O","X"],["X","O","X","X"]]
 <strong>输出：</strong>[["X","X","X","X"],["X","X","X","X"],["X","X","X","X"],["X","O","X","X"]]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/8.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/8.exercises/solution.md"
index 170cc8ffa..20d9aba4b 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/8.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/8.exercises/solution.md"
@@ -5,7 +5,7 @@
 <p>问总共有多少条不同的路径？</p>
 <p> </p>
 <p><strong>示例 1：</strong></p><img
-    src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0062.Unique%20Paths/images/robot_maze.png" />
+    src="https://img-service.csdnimg.cn/img_convert/099169dc43ebe3d42afb948803f38eda.png" />
 <pre><strong>输入：</strong>m = 3, n = 7<strong><br />输出：</strong>28</pre>
 <p><strong>示例 2：</strong></p>
 <pre><strong>输入：</strong>m = 3, n = 2<strong><br />输出：</strong>3<strong><br />解释：</strong>从左上角开始，总共有 3 条路径可以到达右下角。<br />1. 向右 -> 向下 -> 向下<br />2. 向下 -> 向下 -> 向右<br />3. 向下 -> 向右 -> 向下</pre>
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/80.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/80.exercises/solution.md"
index b38073a29..871de3064 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/80.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/80.exercises/solution.md"
@@ -23,7 +23,7 @@
 
 <p><strong>示例 1：</strong></p>
 
-<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/02/01/133_clone_graph_question.png" style="height: 500px; width: 500px;"></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/4665a14e8275dcebde63ce3942d110d2.png" style="height: 500px; width: 500px;"></p>
 
 <pre><strong>输入：</strong>adjList = [[2,4],[1,3],[2,4],[1,3]]
 <strong>输出：</strong>[[2,4],[1,3],[2,4],[1,3]]
@@ -37,7 +37,7 @@
 
 <p><strong>示例 2：</strong></p>
 
-<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/02/01/graph.png" style="height: 148px; width: 163px;"></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/8cfbd9dc508e987b546cd2f0fd792014.png" style="height: 148px; width: 163px;"></p>
 
 <pre><strong>输入：</strong>adjList = [[]]
 <strong>输出：</strong>[[]]
@@ -53,7 +53,7 @@
 
 <p><strong>示例 4：</strong></p>
 
-<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/02/01/graph-1.png" style="height: 133px; width: 272px;"></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/dc82e82c9a0f178d4d1b6f5a85353dee.png" style="height: 133px; width: 272px;"></p>
 
 <pre><strong>输入：</strong>adjList = [[2],[1]]
 <strong>输出：</strong>[[2],[1]]</pre>
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/83.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/83.exercises/solution.md"
index eda011dcc..efa52728a 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/83.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/83.exercises/solution.md"
@@ -21,7 +21,7 @@
 
 <p><strong>示例 1：</strong></p>
 
-<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/01/09/e1.png" style="height: 138px; width: 680px;" /></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/f8f9507766d2b669c1fc4602abb42bcc.png" style="height: 138px; width: 680px;" /></p>
 
 <pre>
 <strong>输入：</strong>head = [[7,null],[13,0],[11,4],[10,2],[1,0]]
@@ -30,7 +30,7 @@
 
 <p><strong>示例 2：</strong></p>
 
-<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/01/09/e2.png" style="height: 111px; width: 680px;" /></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/5b1d9935e44c90100e9e651df9c95804.png" style="height: 111px; width: 680px;" /></p>
 
 <pre>
 <strong>输入：</strong>head = [[1,1],[2,1]]
@@ -39,7 +39,7 @@
 
 <p><strong>示例 3：</strong></p>
 
-<p><strong><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/01/09/e3.png" style="height: 119px; width: 680px;" /></strong></p>
+<p><strong><img alt="" src="https://img-service.csdnimg.cn/img_convert/644c55218eecea6200881f4bea3a3a95.png" style="height: 119px; width: 680px;" /></strong></p>
 
 <pre>
 <strong>输入：</strong>head = [[3,null],[3,0],[3,null]]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/85.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/85.exercises/solution.md"
index 40cd62288..b35428e2c 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/85.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/85.exercises/solution.md"
@@ -16,7 +16,7 @@
 
 <p><strong>示例 1：</strong></p>
 
-<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/12/07/circularlinkedlist.png" style="height: 97px; width: 300px;" /></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/4a18acda10c1606aa5d1132b9de26d61.png" style="height: 97px; width: 300px;" /></p>
 
 <pre>
 <strong>输入：</strong>head = [3,2,0,-4], pos = 1
@@ -26,7 +26,7 @@
 
 <p><strong>示例 2：</strong></p>
 
-<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>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/1a6fcfc68d7340c39151075f7fa53150.png" style="height: 74px; width: 141px;" /></p>
 
 <pre>
 <strong>输入：</strong>head = [1,2], pos = 0
@@ -36,7 +36,7 @@
 
 <p><strong>示例 3：</strong></p>
 
-<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>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/3039274e08a9385ea77b20a81060ed40.png" style="height: 45px; width: 45px;" /></p>
 
 <pre>
 <strong>输入：</strong>head = [1], pos = -1
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/86.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/86.exercises/solution.md"
index 7bbd3f3dd..c82baf268 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/86.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/86.exercises/solution.md"
@@ -13,7 +13,7 @@
 
 <p><strong>示例 1:</strong></p>
 
-<p><img alt="" src="https://pic.leetcode-cn.com/1626420311-PkUiGI-image.png" style="width: 240px; " /></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/749247317f1c95079a7daa32d6b7da96.png" style="width: 240px; " /></p>
 
 <pre>
 <strong>输入: </strong>head = [1,2,3,4]
@@ -21,7 +21,7 @@
 
 <p><strong>示例 2:</strong></p>
 
-<p><img alt="" src="https://pic.leetcode-cn.com/1626420320-YUiulT-image.png" style="width: 320px; " /></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/f425cb8c2d72409c26564abcdb8cb629.png" style="width: 320px; " /></p>
 
 <pre>
 <strong>输入: </strong>head = [1,2,3,4,5]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/88.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/88.exercises/solution.md"
index a1c627ff7..c50925eaa 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/88.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/88.exercises/solution.md"
@@ -2,7 +2,7 @@
 
 <p>对链表进行插入排序。</p>
 
-<p><img alt="" src="https://upload.wikimedia.org/wikipedia/commons/0/0f/Insertion-sort-example-300px.gif"><br>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/9400029b6559a5f16c48610324ceb961.png"><br>
 <small>插入排序的动画演示如上。从第一个元素开始，该链表可以被认为已经部分排序（用黑色表示）。<br>
 每次迭代时，从输入数据中移除一个元素（用红色表示），并原地将其插入到已排好序的链表中。</small></p>
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/89.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/89.exercises/solution.md"
index bb862a6a5..77e447ffc 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/89.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/89.exercises/solution.md"
@@ -11,14 +11,14 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/09/14/sort_list_1.jpg" style="width: 302px; "/>
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/f2b8957105894d4fe9ffe9462e65f8e8.jpeg" style="width: 302px; "/>
 <pre>
 <b>输入：</b>head = [4,2,1,3]
 <b>输出：</b>[1,2,3,4]
 </pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/09/14/sort_list_2.jpg" style="width: 402px; " />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/f10bc169c916b5b0bc8651e5f7e99492.jpeg" style="width: 402px; " />
 <pre>
 <b>输入：</b>head = [-1,5,3,4,0]
 <b>输出：</b>[-1,0,3,4,5]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/9.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/9.exercises/solution.md"
index db087f25b..bee32c5b6 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/9.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/9.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 电话号码的字母组合
 
-<p>给定一个仅包含数字 <code>2-9</code> 的字符串，返回所有它能表示的字母组合。答案可以按 <strong>任意顺序</strong> 返回。</p><p>给出数字到字母的映射如下（与电话按键相同）。注意 1 不对应任何字母。</p><p><img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0017.Letter%20Combinations%20of%20a%20Phone%20Number/images/17_telephone_keypad.png" style="width: 200px;" /></p><p> </p><p><strong>示例 1：</strong></p><pre><strong>输入：</strong>digits = "23"<strong><br />输出：</strong>["ad","ae","af","bd","be","bf","cd","ce","cf"]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>digits = ""<strong><br />输出：</strong>[]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>digits = "2"<strong><br />输出：</strong>["a","b","c"]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>0 <= digits.length <= 4</code></li>	<li><code>digits[i]</code> 是范围 <code>['2', '9']</code> 的一个数字。</li></ul>
+<p>给定一个仅包含数字 <code>2-9</code> 的字符串，返回所有它能表示的字母组合。答案可以按 <strong>任意顺序</strong> 返回。</p><p>给出数字到字母的映射如下（与电话按键相同）。注意 1 不对应任何字母。</p><p><img src="https://img-service.csdnimg.cn/img_convert/71e2c27cd43a6f678c1972f865e982d0.png" style="width: 200px;" /></p><p> </p><p><strong>示例 1：</strong></p><pre><strong>输入：</strong>digits = "23"<strong><br />输出：</strong>["ad","ae","af","bd","be","bf","cd","ce","cf"]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>digits = ""<strong><br />输出：</strong>[]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>digits = "2"<strong><br />输出：</strong>["a","b","c"]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>0 <= digits.length <= 4</code></li>	<li><code>digits[i]</code> 是范围 <code>['2', '9']</code> 的一个数字。</li></ul>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/97.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/2.java/97.exercises/solution.md"
index 807e519ac..fc14666d0 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/97.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/97.exercises/solution.md"
@@ -18,7 +18,7 @@
 <p> </p>
 
 <p><strong>示例：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2018/12/25/bst-tree.png" style="width: 189px; height: 178px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/743f55b78d358ff4ba5fbb7d8088a0d9.png" style="width: 189px; height: 178px;" />
 <pre>
 <strong>输入</strong>
 ["BSTIterator", "next", "next", "hasNext", "next", "hasNext", "next", "hasNext", "next", "hasNext"]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/101.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/101.exercises/solution.md"
index 443cb4da3..b766514a3 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/101.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/101.exercises/solution.md"
@@ -6,7 +6,7 @@
 
 <p><strong>示例 1:</strong></p>
 
-<p><img src="https://assets.leetcode.com/uploads/2021/02/14/tree.jpg" style="width: 270px; " /></p>
+<p><img src="https://img-service.csdnimg.cn/img_convert/d8e254ac37a1738da124338966297a76.jpeg" style="width: 270px; " /></p>
 
 <pre>
 <strong>输入:</strong> [1,2,3,null,5,null,4]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/11.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/11.exercises/solution.md"
index 161b2eff3..c80cf2a0c 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/11.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/11.exercises/solution.md"
@@ -7,7 +7,7 @@
     <p>&nbsp;</p>
 
     <p><strong>示例 1：</strong></p>
-    <img style="width: 600px; height: 148px;" src="https://assets.leetcode.com/uploads/2021/01/18/uniquebstn3.jpg"
+    <img style="width: 600px; height: 148px;" src="https://img-service.csdnimg.cn/img_convert/afa8711beb3c6f3c54d039379f525fb7.jpeg"
         alt="">
     <pre><strong>输入：</strong>n = 3
 <strong>输出：</strong>5
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/14.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/14.exercises/solution.md"
index f947c89be..207d72bb1 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/14.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/14.exercises/solution.md"
@@ -32,7 +32,7 @@
 
     <p>例如，数字字符串 <code>"3322251"</code> 的描述如下图：</p>
     <img alt=""
-        src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0038.Count%20and%20Say/images/countandsay.jpg"
+        src="https://img-service.csdnimg.cn/img_convert/23bfeaec5ed390ee12e4ab4f6bd7da5a.jpeg"
         style="width: 581px; height: 172px;" />
     <ul>
     </ul>
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/15.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/15.exercises/solution.md"
index e21839126..b9061c63b 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/15.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/15.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 旋转链表
 
-<p>给你一个链表的头节点 <code>head</code> ，旋转链表，将链表每个节点向右移动 <code>k</code><em> </em>个位置。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0061.Rotate%20List/images/rotate1.jpg" style="width: 600px; height: 254px;" /><pre><strong>输入：</strong>head = [1,2,3,4,5], k = 2<strong><br />输出：</strong>[4,5,1,2,3]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0061.Rotate%20List/images/roate2.jpg" style="width: 472px; height: 542px;" /><pre><strong>输入：</strong>head = [0,1,2], k = 4<strong><br />输出：</strong>[2,0,1]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点的数目在范围 <code>[0, 500]</code> 内</li>	<li><code>-100 <= Node.val <= 100</code></li>	<li><code>0 <= k <= 2 * 10<sup>9</sup></code></li></ul>
+<p>给你一个链表的头节点 <code>head</code> ，旋转链表，将链表每个节点向右移动 <code>k</code><em> </em>个位置。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/c0d8ae472058ab78d44488d3d18b7d34.jpeg" style="width: 600px; height: 254px;" /><pre><strong>输入：</strong>head = [1,2,3,4,5], k = 2<strong><br />输出：</strong>[4,5,1,2,3]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/b36376b20ad1074341ffc8bca9a32eca.jpeg" style="width: 472px; height: 542px;" /><pre><strong>输入：</strong>head = [0,1,2], k = 4<strong><br />输出：</strong>[2,0,1]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点的数目在范围 <code>[0, 500]</code> 内</li>	<li><code>-100 <= Node.val <= 100</code></li>	<li><code>0 <= k <= 2 * 10<sup>9</sup></code></li></ul>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/18.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/18.exercises/solution.md"
index 744918da7..9ed4b6233 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/18.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/18.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 旋转图像
 
-<p>给定一个 <em>n </em>× <em>n</em> 的二维矩阵 <code>matrix</code> 表示一个图像。请你将图像顺时针旋转 90 度。</p><p>你必须在<strong><a href="https://baike.baidu.com/item/%E5%8E%9F%E5%9C%B0%E7%AE%97%E6%B3%95" target="_blank"> 原地</a></strong> 旋转图像，这意味着你需要直接修改输入的二维矩阵。<strong>请不要 </strong>使用另一个矩阵来旋转图像。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0048.Rotate%20Image/images/mat1.jpg" style="width: 642px; height: 242px;" /><pre><strong>输入：</strong>matrix = [[1,2,3],[4,5,6],[7,8,9]]<strong><br />输出：</strong>[[7,4,1],[8,5,2],[9,6,3]]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0048.Rotate%20Image/images/mat2.jpg" style="width: 800px; height: 321px;" /><pre><strong>输入：</strong>matrix = [[5,1,9,11],[2,4,8,10],[13,3,6,7],[15,14,12,16]]<strong><br />输出：</strong>[[15,13,2,5],[14,3,4,1],[12,6,8,9],[16,7,10,11]]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>matrix = [[1]]<strong><br />输出：</strong>[[1]]</pre><p><strong>示例 4：</strong></p><pre><strong>输入：</strong>matrix = [[1,2],[3,4]]<strong><br />输出：</strong>[[3,1],[4,2]]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>matrix.length == n</code></li>	<li><code>matrix[i].length == n</code></li>	<li><code>1 <= n <= 20</code></li>	<li><code>-1000 <= matrix[i][j] <= 1000</code></li></ul>
+<p>给定一个 <em>n </em>× <em>n</em> 的二维矩阵 <code>matrix</code> 表示一个图像。请你将图像顺时针旋转 90 度。</p><p>你必须在<strong><a href="https://baike.baidu.com/item/%E5%8E%9F%E5%9C%B0%E7%AE%97%E6%B3%95" target="_blank"> 原地</a></strong> 旋转图像，这意味着你需要直接修改输入的二维矩阵。<strong>请不要 </strong>使用另一个矩阵来旋转图像。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/9a815a9eeb64d633de1bcd8d864f069d.jpeg" style="width: 642px; height: 242px;" /><pre><strong>输入：</strong>matrix = [[1,2,3],[4,5,6],[7,8,9]]<strong><br />输出：</strong>[[7,4,1],[8,5,2],[9,6,3]]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/5f637f84287da51eb330d2128bfb306f.jpeg" style="width: 800px; height: 321px;" /><pre><strong>输入：</strong>matrix = [[5,1,9,11],[2,4,8,10],[13,3,6,7],[15,14,12,16]]<strong><br />输出：</strong>[[15,13,2,5],[14,3,4,1],[12,6,8,9],[16,7,10,11]]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>matrix = [[1]]<strong><br />输出：</strong>[[1]]</pre><p><strong>示例 4：</strong></p><pre><strong>输入：</strong>matrix = [[1,2],[3,4]]<strong><br />输出：</strong>[[3,1],[4,2]]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>matrix.length == n</code></li>	<li><code>matrix[i].length == n</code></li>	<li><code>1 <= n <= 20</code></li>	<li><code>-1000 <= matrix[i][j] <= 1000</code></li></ul>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/19.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/19.exercises/solution.md"
index a7a762d86..d2c3c80c4 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/19.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/19.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 盛最多水的容器
 
-<p>给你 <code>n</code> 个非负整数 <code>a<sub>1</sub>，a<sub>2，</sub>...，a</code><sub><code>n</code>，</sub>每个数代表坐标中的一个点 <code>(i, a<sub>i</sub>)</code> 。在坐标内画 <code>n</code> 条垂直线，垂直线 <code>i</code> 的两个端点分别为 <code>(i, a<sub>i</sub>)</code> 和 <code>(i, 0)</code> 。找出其中的两条线，使得它们与 <code>x</code> 轴共同构成的容器可以容纳最多的水。</p><p><strong>说明：</strong>你不能倾斜容器。</p><p> </p><p><strong>示例 1：</strong></p><p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0011.Container%20With%20Most%20Water/images/question_11.jpg" style="height: 287px; width: 600px;" /></p><pre><strong>输入：</strong>[1,8,6,2,5,4,8,3,7]<strong><br />输出：</strong>49 <strong><br />解释：</strong>图中垂直线代表输入数组 [1,8,6,2,5,4,8,3,7]。在此情况下，容器能够容纳水（表示为蓝色部分）的最大值为 49。</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>height = [1,1]<strong><br />输出：</strong>1</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>height = [4,3,2,1,4]<strong><br />输出：</strong>16</pre><p><strong>示例 4：</strong></p><pre><strong>输入：</strong>height = [1,2,1]<strong><br />输出：</strong>2</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>n = height.length</code></li>	<li><code>2 <= n <= 3 * 10<sup>4</sup></code></li>	<li><code>0 <= height[i] <= 3 * 10<sup>4</sup></code></li></ul>
+<p>给你 <code>n</code> 个非负整数 <code>a<sub>1</sub>，a<sub>2，</sub>...，a</code><sub><code>n</code>，</sub>每个数代表坐标中的一个点 <code>(i, a<sub>i</sub>)</code> 。在坐标内画 <code>n</code> 条垂直线，垂直线 <code>i</code> 的两个端点分别为 <code>(i, a<sub>i</sub>)</code> 和 <code>(i, 0)</code> 。找出其中的两条线，使得它们与 <code>x</code> 轴共同构成的容器可以容纳最多的水。</p><p><strong>说明：</strong>你不能倾斜容器。</p><p> </p><p><strong>示例 1：</strong></p><p><img alt="" src="https://img-service.csdnimg.cn/img_convert/68b73af992268f52fa1d1edf7891fcc2.jpeg" style="height: 287px; width: 600px;" /></p><pre><strong>输入：</strong>[1,8,6,2,5,4,8,3,7]<strong><br />输出：</strong>49 <strong><br />解释：</strong>图中垂直线代表输入数组 [1,8,6,2,5,4,8,3,7]。在此情况下，容器能够容纳水（表示为蓝色部分）的最大值为 49。</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>height = [1,1]<strong><br />输出：</strong>1</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>height = [4,3,2,1,4]<strong><br />输出：</strong>16</pre><p><strong>示例 4：</strong></p><pre><strong>输入：</strong>height = [1,2,1]<strong><br />输出：</strong>2</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>n = height.length</code></li>	<li><code>2 <= n <= 3 * 10<sup>4</sup></code></li>	<li><code>0 <= height[i] <= 3 * 10<sup>4</sup></code></li></ul>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/25.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/25.exercises/solution.md"
index 10e1c2927..dad472025 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/25.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/25.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 两数相加
 
-<p>给你两个 <strong>非空</strong> 的链表，表示两个非负的整数。它们每位数字都是按照 <strong>逆序</strong> 的方式存储的，并且每个节点只能存储 <strong>一位</strong> 数字。</p><p>请你将两个数相加，并以相同形式返回一个表示和的链表。</p><p>你可以假设除了数字 0 之外，这两个数都不会以 0 开头。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0002.Add%20Two%20Numbers/images/addtwonumber1.jpg" style="width: 483px; height: 342px;" /><pre><strong>输入：</strong>l1 = [2,4,3], l2 = [5,6,4]<strong><br />输出：</strong>[7,0,8]<strong><br />解释：</strong>342 + 465 = 807.</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>l1 = [0], l2 = [0]<strong><br />输出：</strong>[0]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]<strong><br />输出：</strong>[8,9,9,9,0,0,0,1]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>每个链表中的节点数在范围 <code>[1, 100]</code> 内</li>	<li><code>0 <= Node.val <= 9</code></li>	<li>题目数据保证列表表示的数字不含前导零</li></ul>
+<p>给你两个 <strong>非空</strong> 的链表，表示两个非负的整数。它们每位数字都是按照 <strong>逆序</strong> 的方式存储的，并且每个节点只能存储 <strong>一位</strong> 数字。</p><p>请你将两个数相加，并以相同形式返回一个表示和的链表。</p><p>你可以假设除了数字 0 之外，这两个数都不会以 0 开头。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/3d2b007db4e6d4c6b2b5ec03d67f97e0.jpeg" style="width: 483px; height: 342px;" /><pre><strong>输入：</strong>l1 = [2,4,3], l2 = [5,6,4]<strong><br />输出：</strong>[7,0,8]<strong><br />解释：</strong>342 + 465 = 807.</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>l1 = [0], l2 = [0]<strong><br />输出：</strong>[0]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]<strong><br />输出：</strong>[8,9,9,9,0,0,0,1]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>每个链表中的节点数在范围 <code>[1, 100]</code> 内</li>	<li><code>0 <= Node.val <= 9</code></li>	<li>题目数据保证列表表示的数字不含前导零</li></ul>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/26.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/26.exercises/solution.md"
index 64fb4a9ed..142d50c7c 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/26.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/26.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 分隔链表
 
-<p>给你一个链表的头节点 <code>head</code> 和一个特定值<em> </em><code>x</code> ，请你对链表进行分隔，使得所有 <strong>小于</strong> <code>x</code> 的节点都出现在 <strong>大于或等于</strong> <code>x</code> 的节点之前。</p><p>你应当 <strong>保留</strong> 两个分区中每个节点的初始相对位置。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0086.Partition%20List/images/partition.jpg" style="width: 662px; height: 222px;" /><pre><strong>输入：</strong>head = [1,4,3,2,5,2], x = 3<strong><br />输出</strong>：[1,2,2,4,3,5]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>head = [2,1], x = 2<strong><br />输出</strong>：[1,2]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点的数目在范围 <code>[0, 200]</code> 内</li>	<li><code>-100 <= Node.val <= 100</code></li>	<li><code>-200 <= x <= 200</code></li></ul>
+<p>给你一个链表的头节点 <code>head</code> 和一个特定值<em> </em><code>x</code> ，请你对链表进行分隔，使得所有 <strong>小于</strong> <code>x</code> 的节点都出现在 <strong>大于或等于</strong> <code>x</code> 的节点之前。</p><p>你应当 <strong>保留</strong> 两个分区中每个节点的初始相对位置。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/54f1177fe2cc4fddce6e1a5553659bee.jpeg" style="width: 662px; height: 222px;" /><pre><strong>输入：</strong>head = [1,4,3,2,5,2], x = 3<strong><br />输出</strong>：[1,2,2,4,3,5]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>head = [2,1], x = 2<strong><br />输出</strong>：[1,2]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点的数目在范围 <code>[0, 200]</code> 内</li>	<li><code>-100 <= Node.val <= 100</code></li>	<li><code>-200 <= x <= 200</code></li></ul>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/32.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/32.exercises/solution.md"
index 26841d88f..f4b00dc04 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/32.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/32.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 螺旋矩阵
 
-<p>给你一个 <code>m</code> 行 <code>n</code> 列的矩阵 <code>matrix</code> ，请按照 <strong>顺时针螺旋顺序</strong> ，返回矩阵中的所有元素。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0054.Spiral%20Matrix/images/spiral1.jpg" style="width: 242px; height: 242px;" /><pre><strong>输入：</strong>matrix = [[1,2,3],[4,5,6],[7,8,9]]<strong><br />输出：</strong>[1,2,3,6,9,8,7,4,5]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0054.Spiral%20Matrix/images/spiral.jpg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]]<strong><br />输出：</strong>[1,2,3,4,8,12,11,10,9,5,6,7]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>m == matrix.length</code></li>	<li><code>n == matrix[i].length</code></li>	<li><code>1 <= m, n <= 10</code></li>	<li><code>-100 <= matrix[i][j] <= 100</code></li></ul>
+<p>给你一个 <code>m</code> 行 <code>n</code> 列的矩阵 <code>matrix</code> ，请按照 <strong>顺时针螺旋顺序</strong> ，返回矩阵中的所有元素。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/0d476dcc094b85563f4f43c393ef1425.jpeg" style="width: 242px; height: 242px;" /><pre><strong>输入：</strong>matrix = [[1,2,3],[4,5,6],[7,8,9]]<strong><br />输出：</strong>[1,2,3,6,9,8,7,4,5]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/1c83ff2d8f7cc194b08715bacdedff99.jpeg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]]<strong><br />输出：</strong>[1,2,3,4,8,12,11,10,9,5,6,7]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>m == matrix.length</code></li>	<li><code>n == matrix[i].length</code></li>	<li><code>1 <= m, n <= 10</code></li>	<li><code>-100 <= matrix[i][j] <= 100</code></li></ul>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/35.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/35.exercises/solution.md"
index 99bf19b09..90b42a926 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/35.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/35.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 搜索二维矩阵
 
-<p>编写一个高效的算法来判断 <code>m x n</code> 矩阵中，是否存在一个目标值。该矩阵具有如下特性：</p><ul>	<li>每行中的整数从左到右按升序排列。</li>	<li>每行的第一个整数大于前一行的最后一个整数。</li></ul><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0074.Search%20a%202D%20Matrix/images/mat.jpg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 3<strong><br />输出：</strong>true</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0074.Search%20a%202D%20Matrix/images/mat2.jpg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 13<strong><br />输出：</strong>false</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>m == matrix.length</code></li>	<li><code>n == matrix[i].length</code></li>	<li><code>1 <= m, n <= 100</code></li>	<li><code>-10<sup>4</sup> <= matrix[i][j], target <= 10<sup>4</sup></code></li></ul>
+<p>编写一个高效的算法来判断 <code>m x n</code> 矩阵中，是否存在一个目标值。该矩阵具有如下特性：</p><ul>	<li>每行中的整数从左到右按升序排列。</li>	<li>每行的第一个整数大于前一行的最后一个整数。</li></ul><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/eb4ca0d861f87843d6d732b4525b0acc.jpeg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 3<strong><br />输出：</strong>true</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/f22033e9dda21437197f5e414c912a3d.jpeg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 13<strong><br />输出：</strong>false</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>m == matrix.length</code></li>	<li><code>n == matrix[i].length</code></li>	<li><code>1 <= m, n <= 100</code></li>	<li><code>-10<sup>4</sup> <= matrix[i][j], target <= 10<sup>4</sup></code></li></ul>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/38.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/38.exercises/solution.md"
index 880dfe359..3bb75c438 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/38.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/38.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 矩阵置零
 
-<p>给定一个 <code><em>m</em> x <em>n</em></code> 的矩阵，如果一个元素为 <strong>0 </strong>，则将其所在行和列的所有元素都设为 <strong>0</strong> 。请使用 <strong><a href="http://baike.baidu.com/item/%E5%8E%9F%E5%9C%B0%E7%AE%97%E6%B3%95" target="_blank">原地</a></strong> 算法<strong>。</strong></p><p><strong>进阶：</strong></p><ul>	<li>一个直观的解决方案是使用  <code>O(<em>m</em><em>n</em>)</code> 的额外空间，但这并不是一个好的解决方案。</li>	<li>一个简单的改进方案是使用 <code>O(<em>m</em> + <em>n</em>)</code> 的额外空间，但这仍然不是最好的解决方案。</li>	<li>你能想出一个仅使用常量空间的解决方案吗？</li></ul><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0073.Set%20Matrix%20Zeroes/images/mat1.jpg" style="width: 450px; height: 169px;" /><pre><strong>输入：</strong>matrix = [[1,1,1],[1,0,1],[1,1,1]]<strong><br />输出：</strong>[[1,0,1],[0,0,0],[1,0,1]]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0073.Set%20Matrix%20Zeroes/images/mat2.jpg" style="width: 450px; height: 137px;" /><pre><strong>输入：</strong>matrix = [[0,1,2,0],[3,4,5,2],[1,3,1,5]]<strong><br />输出：</strong>[[0,0,0,0],[0,4,5,0],[0,3,1,0]]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>m == matrix.length</code></li>	<li><code>n == matrix[0].length</code></li>	<li><code>1 <= m, n <= 200</code></li>	<li><code>-2<sup>31</sup> <= matrix[i][j] <= 2<sup>31</sup> - 1</code></li></ul>
+<p>给定一个 <code><em>m</em> x <em>n</em></code> 的矩阵，如果一个元素为 <strong>0 </strong>，则将其所在行和列的所有元素都设为 <strong>0</strong> 。请使用 <strong><a href="http://baike.baidu.com/item/%E5%8E%9F%E5%9C%B0%E7%AE%97%E6%B3%95" target="_blank">原地</a></strong> 算法<strong>。</strong></p><p><strong>进阶：</strong></p><ul>	<li>一个直观的解决方案是使用  <code>O(<em>m</em><em>n</em>)</code> 的额外空间，但这并不是一个好的解决方案。</li>	<li>一个简单的改进方案是使用 <code>O(<em>m</em> + <em>n</em>)</code> 的额外空间，但这仍然不是最好的解决方案。</li>	<li>你能想出一个仅使用常量空间的解决方案吗？</li></ul><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/a9dfa884d1a855d6630087aa890a20f8.jpeg" style="width: 450px; height: 169px;" /><pre><strong>输入：</strong>matrix = [[1,1,1],[1,0,1],[1,1,1]]<strong><br />输出：</strong>[[1,0,1],[0,0,0],[1,0,1]]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/816bcf700b7a5b0c1b118f9aaac5bb58.jpeg" style="width: 450px; height: 137px;" /><pre><strong>输入：</strong>matrix = [[0,1,2,0],[3,4,5,2],[1,3,1,5]]<strong><br />输出：</strong>[[0,0,0,0],[0,4,5,0],[0,3,1,0]]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>m == matrix.length</code></li>	<li><code>n == matrix[0].length</code></li>	<li><code>1 <= m, n <= 200</code></li>	<li><code>-2<sup>31</sup> <= matrix[i][j] <= 2<sup>31</sup> - 1</code></li></ul>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/41.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/41.exercises/solution.md"
index b9ae47a3c..0f92275dd 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/41.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/41.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 反转链表 II
 
-给你单链表的头指针 <code>head</code> 和两个整数 <code>left</code> 和 <code>right</code> ，其中 <code>left <= right</code> 。请你反转从位置 <code>left</code> 到位置 <code>right</code> 的链表节点，返回 <strong>反转后的链表</strong> 。<p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0092.Reverse%20Linked%20List%20II/images/rev2ex2.jpg" style="width: 542px; height: 222px;" /><pre><strong>输入：</strong>head = [1,2,3,4,5], left = 2, right = 4<strong><br />输出：</strong>[1,4,3,2,5]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>head = [5], left = 1, right = 1<strong><br />输出：</strong>[5]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点数目为 <code>n</code></li>	<li><code>1 <= n <= 500</code></li>	<li><code>-500 <= Node.val <= 500</code></li>	<li><code>1 <= left <= right <= n</code></li></ul><p> </p><p><strong>进阶：</strong> 你可以使用一趟扫描完成反转吗？</p>
+给你单链表的头指针 <code>head</code> 和两个整数 <code>left</code> 和 <code>right</code> ，其中 <code>left <= right</code> 。请你反转从位置 <code>left</code> 到位置 <code>right</code> 的链表节点，返回 <strong>反转后的链表</strong> 。<p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/c664df96e99b9097662307d2e0368322.jpeg" style="width: 542px; height: 222px;" /><pre><strong>输入：</strong>head = [1,2,3,4,5], left = 2, right = 4<strong><br />输出：</strong>[1,4,3,2,5]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>head = [5], left = 1, right = 1<strong><br />输出：</strong>[5]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点数目为 <code>n</code></li>	<li><code>1 <= n <= 500</code></li>	<li><code>-500 <= Node.val <= 500</code></li>	<li><code>1 <= left <= right <= n</code></li></ul><p> </p><p><strong>进阶：</strong> 你可以使用一趟扫描完成反转吗？</p>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/42.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/42.exercises/solution.md"
index a8135c320..7f975a051 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/42.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/42.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 最小路径和
 
-<p>给定一个包含非负整数的 <code><em>m</em> x <em>n</em></code> 网格 <code>grid</code> ，请找出一条从左上角到右下角的路径，使得路径上的数字总和为最小。</p><p><strong>说明：</strong>每次只能向下或者向右移动一步。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0064.Minimum%20Path%20Sum/images/minpath.jpg" style="width: 242px; height: 242px;" /><pre><strong>输入：</strong>grid = [[1,3,1],[1,5,1],[4,2,1]]<strong><br />输出：</strong>7<strong><br />解释：</strong>因为路径 1→3→1→1→1 的总和最小。</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>grid = [[1,2,3],[4,5,6]]<strong><br />输出：</strong>12</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>m == grid.length</code></li>	<li><code>n == grid[i].length</code></li>	<li><code>1 <= m, n <= 200</code></li>	<li><code>0 <= grid[i][j] <= 100</code></li></ul>
+<p>给定一个包含非负整数的 <code><em>m</em> x <em>n</em></code> 网格 <code>grid</code> ，请找出一条从左上角到右下角的路径，使得路径上的数字总和为最小。</p><p><strong>说明：</strong>每次只能向下或者向右移动一步。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/0c6d9496445c66b255a406ba2f9a3eb9.jpeg" style="width: 242px; height: 242px;" /><pre><strong>输入：</strong>grid = [[1,3,1],[1,5,1],[4,2,1]]<strong><br />输出：</strong>7<strong><br />解释：</strong>因为路径 1→3→1→1→1 的总和最小。</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>grid = [[1,2,3],[4,5,6]]<strong><br />输出：</strong>12</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>m == grid.length</code></li>	<li><code>n == grid[i].length</code></li>	<li><code>1 <= m, n <= 200</code></li>	<li><code>0 <= grid[i][j] <= 100</code></li></ul>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/43.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/43.exercises/solution.md"
index 8eb6eb9e4..77e5b53bf 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/43.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/43.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 删除链表的倒数第 N 个结点
 
-<p>给你一个链表，删除链表的倒数第 <code>n</code><em> </em>个结点，并且返回链表的头结点。</p><p><strong>进阶：</strong>你能尝试使用一趟扫描实现吗？</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0019.Remove%20Nth%20Node%20From%20End%20of%20List/images/remove_ex1.jpg" style="width: 542px; height: 222px;" /><pre><strong>输入：</strong>head = [1,2,3,4,5], n = 2<strong><br />输出：</strong>[1,2,3,5]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>head = [1], n = 1<strong><br />输出：</strong>[]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>head = [1,2], n = 1<strong><br />输出：</strong>[1]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中结点的数目为 <code>sz</code></li>	<li><code>1 <= sz <= 30</code></li>	<li><code>0 <= Node.val <= 100</code></li>	<li><code>1 <= n <= sz</code></li></ul>
+<p>给你一个链表，删除链表的倒数第 <code>n</code><em> </em>个结点，并且返回链表的头结点。</p><p><strong>进阶：</strong>你能尝试使用一趟扫描实现吗？</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/3ab1d7132da7283b4578c8df78c8fb67.jpeg" style="width: 542px; height: 222px;" /><pre><strong>输入：</strong>head = [1,2,3,4,5], n = 2<strong><br />输出：</strong>[1,2,3,5]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>head = [1], n = 1<strong><br />输出：</strong>[]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>head = [1,2], n = 1<strong><br />输出：</strong>[1]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中结点的数目为 <code>sz</code></li>	<li><code>1 <= sz <= 30</code></li>	<li><code>0 <= Node.val <= 100</code></li>	<li><code>1 <= n <= sz</code></li></ul>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/48.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/48.exercises/solution.md"
index 58fab504f..d2bf91694 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/48.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/48.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 交错字符串
 
-<p>给定三个字符串 <code>s1</code>、<code>s2</code>、<code>s3</code>，请你帮忙验证 <code>s3</code> 是否是由 <code>s1</code> 和 <code>s2</code><em> </em><strong>交错 </strong>组成的。</p><p>两个字符串 <code>s</code> 和 <code>t</code> <strong>交错</strong> 的定义与过程如下，其中每个字符串都会被分割成若干 <strong>非空</strong> 子字符串：</p><ul>	<li><code>s = s<sub>1</sub> + s<sub>2</sub> + ... + s<sub>n</sub></code></li>	<li><code>t = t<sub>1</sub> + t<sub>2</sub> + ... + t<sub>m</sub></code></li>	<li><code>|n - m| <= 1</code></li>	<li><strong>交错</strong> 是 <code>s<sub>1</sub> + t<sub>1</sub> + s<sub>2</sub> + t<sub>2</sub> + s<sub>3</sub> + t<sub>3</sub> + ...</code> 或者 <code>t<sub>1</sub> + s<sub>1</sub> + t<sub>2</sub> + s<sub>2</sub> + t<sub>3</sub> + s<sub>3</sub> + ...</code></li></ul><p><strong>提示：</strong><code>a + b</code> 意味着字符串 <code>a</code> 和 <code>b</code> 连接。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0097.Interleaving%20String/images/interleave.jpg" style="width: 561px; height: 203px;" /><pre><strong>输入：</strong>s1 = "aabcc", s2 = "dbbca", s3 = "aadbbcbcac"<strong><br />输出：</strong>true</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>s1 = "aabcc", s2 = "dbbca", s3 = "aadbbbaccc"<strong><br />输出：</strong>false</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>s1 = "", s2 = "", s3 = ""<strong><br />输出：</strong>true</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>0 <= s1.length, s2.length <= 100</code></li>	<li><code>0 <= s3.length <= 200</code></li>	<li><code>s1</code>、<code>s2</code>、和 <code>s3</code> 都由小写英文字母组成</li></ul>
+<p>给定三个字符串 <code>s1</code>、<code>s2</code>、<code>s3</code>，请你帮忙验证 <code>s3</code> 是否是由 <code>s1</code> 和 <code>s2</code><em> </em><strong>交错 </strong>组成的。</p><p>两个字符串 <code>s</code> 和 <code>t</code> <strong>交错</strong> 的定义与过程如下，其中每个字符串都会被分割成若干 <strong>非空</strong> 子字符串：</p><ul>	<li><code>s = s<sub>1</sub> + s<sub>2</sub> + ... + s<sub>n</sub></code></li>	<li><code>t = t<sub>1</sub> + t<sub>2</sub> + ... + t<sub>m</sub></code></li>	<li><code>|n - m| <= 1</code></li>	<li><strong>交错</strong> 是 <code>s<sub>1</sub> + t<sub>1</sub> + s<sub>2</sub> + t<sub>2</sub> + s<sub>3</sub> + t<sub>3</sub> + ...</code> 或者 <code>t<sub>1</sub> + s<sub>1</sub> + t<sub>2</sub> + s<sub>2</sub> + t<sub>3</sub> + s<sub>3</sub> + ...</code></li></ul><p><strong>提示：</strong><code>a + b</code> 意味着字符串 <code>a</code> 和 <code>b</code> 连接。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/d01d6f6906b7777c9823a97e68b77d06.jpeg" style="width: 561px; height: 203px;" /><pre><strong>输入：</strong>s1 = "aabcc", s2 = "dbbca", s3 = "aadbbcbcac"<strong><br />输出：</strong>true</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>s1 = "aabcc", s2 = "dbbca", s3 = "aadbbbaccc"<strong><br />输出：</strong>false</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>s1 = "", s2 = "", s3 = ""<strong><br />输出：</strong>true</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>0 <= s1.length, s2.length <= 100</code></li>	<li><code>0 <= s3.length <= 200</code></li>	<li><code>s1</code>、<code>s2</code>、和 <code>s3</code> 都由小写英文字母组成</li></ul>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/5.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/5.exercises/solution.md"
index 0c9870507..aca31cd87 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/5.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/5.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 恢复二叉搜索树
 
-<p>给你二叉搜索树的根节点 <code>root</code> ，该树中的两个节点被错误地交换。请在不改变其结构的情况下，恢复这棵树。</p><p><strong>进阶：</strong>使用 O(<em>n</em>) 空间复杂度的解法很容易实现。你能想出一个只使用常数空间的解决方案吗？</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0099.Recover%20Binary%20Search%20Tree/images/recover1.jpg" style="width: 422px; height: 302px;" /><pre><strong>输入：</strong>root = [1,3,null,null,2]<strong><br />输出：</strong>[3,1,null,null,2]<strong><br />解释：</strong>3 不能是 1 左孩子，因为 3 > 1 。交换 1 和 3 使二叉搜索树有效。</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0099.Recover%20Binary%20Search%20Tree/images/recover2.jpg" style="width: 581px; height: 302px;" /><pre><strong>输入：</strong>root = [3,1,4,null,null,2]<strong><br />输出：</strong>[2,1,4,null,null,3]<strong><br />解释：</strong>2 不能在 3 的右子树中，因为 2 < 3 。交换 2 和 3 使二叉搜索树有效。</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>树上节点的数目在范围 <code>[2, 1000]</code> 内</li>	<li><code>-2<sup>31</sup> <= Node.val <= 2<sup>31</sup> - 1</code></li></ul>
+<p>给你二叉搜索树的根节点 <code>root</code> ，该树中的两个节点被错误地交换。请在不改变其结构的情况下，恢复这棵树。</p><p><strong>进阶：</strong>使用 O(<em>n</em>) 空间复杂度的解法很容易实现。你能想出一个只使用常数空间的解决方案吗？</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/ec4e4b2849cccb75be04428664afb2fc.jpeg" style="width: 422px; height: 302px;" /><pre><strong>输入：</strong>root = [1,3,null,null,2]<strong><br />输出：</strong>[3,1,null,null,2]<strong><br />解释：</strong>3 不能是 1 左孩子，因为 3 > 1 。交换 1 和 3 使二叉搜索树有效。</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/c039bf633cb8b3bfbb70a26e931a4f53.jpeg" style="width: 581px; height: 302px;" /><pre><strong>输入：</strong>root = [3,1,4,null,null,2]<strong><br />输出：</strong>[2,1,4,null,null,3]<strong><br />解释：</strong>2 不能在 3 的右子树中，因为 2 < 3 。交换 2 和 3 使二叉搜索树有效。</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>树上节点的数目在范围 <code>[2, 1000]</code> 内</li>	<li><code>-2<sup>31</sup> <= Node.val <= 2<sup>31</sup> - 1</code></li></ul>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/54.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/54.exercises/solution.md"
index 8235c3cbd..a99477267 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/54.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/54.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 单词搜索
 
-<p>给定一个 <code>m x n</code> 二维字符网格 <code>board</code> 和一个字符串单词 <code>word</code> 。如果 <code>word</code> 存在于网格中，返回 <code>true</code> ；否则，返回 <code>false</code> 。</p><p>单词必须按照字母顺序，通过相邻的单元格内的字母构成，其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母不允许被重复使用。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0079.Word%20Search/images/word2.jpg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCCED"<strong><br />输出：</strong>true</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0079.Word%20Search/images/word-1.jpg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "SEE"<strong><br />输出：</strong>true</pre><p><strong>示例 3：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0079.Word%20Search/images/word3.jpg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCB"<strong><br />输出：</strong>false</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>m == board.length</code></li>	<li><code>n = board[i].length</code></li>	<li><code>1 <= m, n <= 6</code></li>	<li><code>1 <= word.length <= 15</code></li>	<li><code>board</code> 和 <code>word</code> 仅由大小写英文字母组成</li></ul><p> </p><p><strong>进阶：</strong>你可以使用搜索剪枝的技术来优化解决方案，使其在 <code>board</code> 更大的情况下可以更快解决问题？</p>
+<p>给定一个 <code>m x n</code> 二维字符网格 <code>board</code> 和一个字符串单词 <code>word</code> 。如果 <code>word</code> 存在于网格中，返回 <code>true</code> ；否则，返回 <code>false</code> 。</p><p>单词必须按照字母顺序，通过相邻的单元格内的字母构成，其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母不允许被重复使用。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/d41f067a92645388770d389f5e4d7269.jpeg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCCED"<strong><br />输出：</strong>true</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/56b7681c631f1e73b77fe9a7475033ea.jpeg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "SEE"<strong><br />输出：</strong>true</pre><p><strong>示例 3：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/58c1e99e8c54dfb7496d44f2d05c8e96.jpeg" style="width: 322px; height: 242px;" /><pre><strong>输入：</strong>board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCB"<strong><br />输出：</strong>false</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>m == board.length</code></li>	<li><code>n = board[i].length</code></li>	<li><code>1 <= m, n <= 6</code></li>	<li><code>1 <= word.length <= 15</code></li>	<li><code>board</code> 和 <code>word</code> 仅由大小写英文字母组成</li></ul><p> </p><p><strong>进阶：</strong>你可以使用搜索剪枝的技术来优化解决方案，使其在 <code>board</code> 更大的情况下可以更快解决问题？</p>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/55.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/55.exercises/solution.md"
index b03fe400e..00dbf231b 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/55.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/55.exercises/solution.md"
@@ -14,13 +14,13 @@
     <p>&nbsp;</p>
 
     <p><strong>示例 1：</strong></p>
-    <img style="width: 302px; height: 182px;" src="https://assets.leetcode.com/uploads/2020/12/01/tree1.jpg" alt="">
+    <img style="width: 302px; height: 182px;" src="https://img-service.csdnimg.cn/img_convert/3d85b39145ecc61874276bcb7cfe6765.jpeg" alt="">
     <pre><strong>输入：</strong>root = [2,1,3]
 <strong>输出：</strong>true
 </pre>
 
     <p><strong>示例 2：</strong></p>
-    <img style="width: 422px; height: 292px;" src="https://assets.leetcode.com/uploads/2020/12/01/tree2.jpg" alt="">
+    <img style="width: 422px; height: 292px;" src="https://img-service.csdnimg.cn/img_convert/f8c9b63a549daf28d19243f8141bb56d.jpeg" alt="">
     <pre><strong>输入：</strong>root = [5,1,4,null,null,3,6]
 <strong>输出：</strong>false
 <strong>解释：</strong>根节点的值是 5 ，但是右子节点的值是 4 。
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/56.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/56.exercises/solution.md"
index 0f118aceb..b494767d4 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/56.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/56.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 删除排序链表中的重复元素 II
 
-<p>存在一个按升序排列的链表，给你这个链表的头节点 <code>head</code> ，请你删除链表中所有存在数字重复情况的节点，只保留原始链表中 <strong>没有重复出现</strong><em> </em>的数字。</p><p>返回同样按升序排列的结果链表。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0082.Remove%20Duplicates%20from%20Sorted%20List%20II/images/linkedlist1.jpg" style="width: 500px; height: 142px;" /><pre><strong>输入：</strong>head = [1,2,3,3,4,4,5]<strong><br />输出：</strong>[1,2,5]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0082.Remove%20Duplicates%20from%20Sorted%20List%20II/images/linkedlist2.jpg" style="width: 500px; height: 205px;" /><pre><strong>输入：</strong>head = [1,1,1,2,3]<strong><br />输出：</strong>[2,3]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点数目在范围 <code>[0, 300]</code> 内</li>	<li><code>-100 <= Node.val <= 100</code></li>	<li>题目数据保证链表已经按升序排列</li></ul>
+<p>存在一个按升序排列的链表，给你这个链表的头节点 <code>head</code> ，请你删除链表中所有存在数字重复情况的节点，只保留原始链表中 <strong>没有重复出现</strong><em> </em>的数字。</p><p>返回同样按升序排列的结果链表。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/5b9243e41528c71944e0f9436d8c249f.jpeg" style="width: 500px; height: 142px;" /><pre><strong>输入：</strong>head = [1,2,3,3,4,4,5]<strong><br />输出：</strong>[1,2,5]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/f43c3f1fdb51738ae73ac8543c9b4e9b.jpeg" style="width: 500px; height: 205px;" /><pre><strong>输入：</strong>head = [1,1,1,2,3]<strong><br />输出：</strong>[2,3]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点数目在范围 <code>[0, 300]</code> 内</li>	<li><code>-100 <= Node.val <= 100</code></li>	<li>题目数据保证链表已经按升序排列</li></ul>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/59.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/59.exercises/solution.md"
index 04e96eae2..4c28e774c 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/59.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/59.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 螺旋矩阵 II
 
-<p>给你一个正整数 <code>n</code> ，生成一个包含 <code>1</code> 到 <code>n<sup>2</sup></code> 所有元素，且元素按顺时针顺序螺旋排列的 <code>n x n</code> 正方形矩阵 <code>matrix</code> 。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0059.Spiral%20Matrix%20II/images/spiraln.jpg" style="width: 242px; height: 242px;" /><pre><strong>输入：</strong>n = 3<strong><br />输出：</strong>[[1,2,3],[8,9,4],[7,6,5]]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>n = 1<strong><br />输出：</strong>[[1]]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>1 <= n <= 20</code></li></ul>
+<p>给你一个正整数 <code>n</code> ，生成一个包含 <code>1</code> 到 <code>n<sup>2</sup></code> 所有元素，且元素按顺时针顺序螺旋排列的 <code>n x n</code> 正方形矩阵 <code>matrix</code> 。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/b2086bc4a6e47ebbf922fed2e817b298.jpeg" style="width: 242px; height: 242px;" /><pre><strong>输入：</strong>n = 3<strong><br />输出：</strong>[[1,2,3],[8,9,4],[7,6,5]]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>n = 1<strong><br />输出：</strong>[[1]]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>1 <= n <= 20</code></li></ul>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/60.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/60.exercises/solution.md"
index d88bdb2db..e77a1a6d0 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/60.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/60.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 两两交换链表中的节点
 
-<p>给定一个链表，两两交换其中相邻的节点，并返回交换后的链表。</p><p><strong>你不能只是单纯的改变节点内部的值</strong>，而是需要实际的进行节点交换。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0024.Swap%20Nodes%20in%20Pairs/images/swap_ex1.jpg" style="width: 422px; height: 222px;" /><pre><strong>输入：</strong>head = [1,2,3,4]<strong><br />输出：</strong>[2,1,4,3]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>head = []<strong><br />输出：</strong>[]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>head = [1]<strong><br />输出：</strong>[1]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点的数目在范围 <code>[0, 100]</code> 内</li>	<li><code>0 <= Node.val <= 100</code></li></ul><p> </p><p><strong>进阶：</strong>你能在不修改链表节点值的情况下解决这个问题吗?（也就是说，仅修改节点本身。）</p>
+<p>给定一个链表，两两交换其中相邻的节点，并返回交换后的链表。</p><p><strong>你不能只是单纯的改变节点内部的值</strong>，而是需要实际的进行节点交换。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/88da15e3bf83dfb0c4784dc6700e84bc.jpeg" style="width: 422px; height: 222px;" /><pre><strong>输入：</strong>head = [1,2,3,4]<strong><br />输出：</strong>[2,1,4,3]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>head = []<strong><br />输出：</strong>[]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>head = [1]<strong><br />输出：</strong>[1]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li>链表中节点的数目在范围 <code>[0, 100]</code> 内</li>	<li><code>0 <= Node.val <= 100</code></li></ul><p> </p><p><strong>进阶：</strong>你能在不修改链表节点值的情况下解决这个问题吗?（也就是说，仅修改节点本身。）</p>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/62.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/62.exercises/solution.md"
index 506cf68de..62fa31888 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/62.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/62.exercises/solution.md"
@@ -3,16 +3,16 @@
 <p>一个机器人位于一个 <em>m x n </em>网格的左上角 （起始点在下图中标记为“Start” ）。</p>
 <p>机器人每次只能向下或者向右移动一步。机器人试图达到网格的右下角（在下图中标记为“Finish”）。</p>
 <p>现在考虑网格中有障碍物。那么从左上角到右下角将会有多少条不同的路径？</p>
-<p><img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0063.Unique%20Paths%20II/images/robot_maze.png"
+<p><img src="https://img-service.csdnimg.cn/img_convert/dcc604a2757b6fd0e6bdc5155c945ffc.png"
         style="height: 183px; width: 400px;" /></p>
 <p>网格中的障碍物和空位置分别用 <code>1</code> 和 <code>0</code> 来表示。</p>
 <p> </p>
 <p><strong>示例 1：</strong></p><img alt=""
-    src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0063.Unique%20Paths%20II/images/robot1.jpg"
+    src="https://img-service.csdnimg.cn/img_convert/d127c16fad8048e19db6f2a2bea73240.jpeg"
     style="width: 242px; height: 242px;" />
 <pre><strong>输入：</strong>obstacleGrid = [[0,0,0],[0,1,0],[0,0,0]]<strong><br />输出：</strong>2<strong><br />解释：</strong>3x3 网格的正中间有一个障碍物。从左上角到右下角一共有 2 条不同的路径：<br />1. 向右 -> 向右 -> 向下 -> 向下<br />2. 向下 -> 向下 -> 向右 -> 向右</pre>
 <p><strong>示例 2：</strong></p><img alt=""
-    src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0063.Unique%20Paths%20II/images/robot2.jpg"
+    src="https://img-service.csdnimg.cn/img_convert/d95382b3c9b30e83be3e383421106a67.jpeg"
     style="width: 162px; height: 162px;" />
 <pre><strong>输入：</strong>obstacleGrid = [[0,1],[0,0]]<strong><br />输出：</strong>1</pre>
 <p> </p>
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/63.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/63.exercises/solution.md"
index a64f6287d..a44a47e74 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/63.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/63.exercises/solution.md"
@@ -14,7 +14,7 @@
 </ul>
 <p> </p>
 <p><strong>示例 1：</strong></p><img
-    src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0036.Valid%20Sudoku/images/250px-sudoku-by-l2g-20050714svg.png"
+    src="https://img-service.csdnimg.cn/img_convert/8aed54207b4871a01fb402d8d21a128b.png"
     style="height:250px; width:250px" />
 <pre><strong>输入：</strong>board = 
     [["5","3",".",".","7",".",".",".","."]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/66.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/66.exercises/solution.md"
index 202c59dba..462efa88d 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/66.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/66.exercises/solution.md"
@@ -5,7 +5,7 @@
 <p> </p>
 
 <p><strong>示例 1:</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/tree.jpg" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/3191074cd189469c9d9199a126b6d035.jpeg" />
 <pre>
 <strong>Input:</strong> preorder = [3,9,20,15,7], inorder = [9,3,15,20,7]
 <strong>Output:</strong> [3,9,20,null,null,15,7]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/7.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/7.exercises/solution.md"
index eeff7b84b..7705aefad 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/7.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/7.exercises/solution.md"
@@ -5,7 +5,7 @@
 <p>问总共有多少条不同的路径？</p>
 <p> </p>
 <p><strong>示例 1：</strong></p><img
-    src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0062.Unique%20Paths/images/robot_maze.png" />
+    src="https://img-service.csdnimg.cn/img_convert/099169dc43ebe3d42afb948803f38eda.png" />
 <pre><strong>输入：</strong>m = 3, n = 7<strong><br />输出：</strong>28</pre>
 <p><strong>示例 2：</strong></p>
 <pre><strong>输入：</strong>m = 3, n = 2<strong><br />输出：</strong>3<strong><br />解释：</strong>从左上角开始，总共有 3 条路径可以到达右下角。<br />1. 向右 -> 向下 -> 向下<br />2. 向下 -> 向下 -> 向右<br />3. 向下 -> 向右 -> 向下</pre>
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/70.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/70.exercises/solution.md"
index dc71d0157..77244b84b 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/70.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/70.exercises/solution.md"
@@ -9,14 +9,14 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/01/18/pathsumii1.jpg" style="width: 500px; height: 356px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/abdc6911d9d9ee1b12dcdbb1945a1ab2.jpeg" style="width: 500px; height: 356px;" />
 <pre>
 <strong>输入：</strong>root = [5,4,8,11,null,13,4,7,2,null,null,5,1], targetSum = 22
 <strong>输出：</strong>[[5,4,11,2],[5,8,4,5]]
 </pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/01/18/pathsum2.jpg" style="width: 212px; height: 181px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/9bc801134935f549d425954a120f1cc3.jpeg" style="width: 212px; height: 181px;" />
 <pre>
 <strong>输入：</strong>root = [1,2,3], targetSum = 5
 <strong>输出：</strong>[]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/71.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/71.exercises/solution.md"
index ba2c8f3ea..c94a6ced7 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/71.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/71.exercises/solution.md"
@@ -10,7 +10,7 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/01/14/flaten.jpg" style="width: 500px; height: 226px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/92075cab0821ae4b0edf18d3de9db0f1.jpeg" style="width: 500px; height: 226px;" />
 <pre>
 <strong>输入：</strong>root = [1,2,5,3,4,null,6]
 <strong>输出：</strong>[1,null,2,null,3,null,4,null,5,null,6]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/72.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/72.exercises/solution.md"
index 3a4ad32c1..7bd3f7bd3 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/72.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/72.exercises/solution.md"
@@ -27,7 +27,7 @@ struct Node {
 
 <p><strong>示例：</strong></p>
 
-<p><img alt="" src="https://assets.leetcode.com/uploads/2019/02/14/116_sample.png" style="height: 205px; width: 600px;" /></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/27903dce19b8e06520fe489475e37ae7.png" style="height: 205px; width: 600px;" /></p>
 
 <pre>
 <b>输入：</b>root = [1,2,3,4,5,6,7]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/73.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/73.exercises/solution.md"
index fb9c095a2..a674783b7 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/73.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/73.exercises/solution.md"
@@ -27,7 +27,7 @@ struct Node {
 
 <p><strong>示例：</strong></p>
 
-<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2019/02/15/117_sample.png" style="height: 218px; width: 640px;" /></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/a5d95fc158b54c265e39bd7e6183494d.png" style="height: 218px; width: 640px;" /></p>
 
 <pre>
 <strong>输入</strong>：root = [1,2,3,4,5,null,7]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/76.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/76.exercises/solution.md"
index 02536fe5a..b4d09a909 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/76.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/76.exercises/solution.md"
@@ -16,7 +16,7 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/num1tree.jpg" style="width: 212px; height: 182px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/c5a171500238f60dc577e49c2a6122ca.jpeg" style="width: 212px; height: 182px;" />
 <pre>
 <strong>输入：</strong>root = [1,2,3]
 <strong>输出：</strong>25
@@ -26,7 +26,7 @@
 因此，数字总和 = 12 + 13 = <code>25</code></pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/num2tree.jpg" style="width: 292px; height: 302px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/3a1c0b2f9917c246eb105ce6c3747969.jpeg" style="width: 292px; height: 302px;" />
 <pre>
 <strong>输入：</strong>root = [4,9,0,5,1]
 <strong>输出：</strong>1026
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/77.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/77.exercises/solution.md"
index 7b4cf36c9..c64f420da 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/77.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/77.exercises/solution.md"
@@ -6,7 +6,7 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/xogrid.jpg" style="width: 550px; height: 237px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/5a3a22bfad68fd1d22012a0ee48ec665.jpeg" style="width: 550px; height: 237px;" />
 <pre>
 <strong>输入：</strong>board = [["X","X","X","X"],["X","O","O","X"],["X","X","O","X"],["X","O","X","X"]]
 <strong>输出：</strong>[["X","X","X","X"],["X","X","X","X"],["X","X","X","X"],["X","O","X","X"]]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/79.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/79.exercises/solution.md"
index cbe146812..798865f5b 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/79.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/79.exercises/solution.md"
@@ -23,7 +23,7 @@
 
 <p><strong>示例 1：</strong></p>
 
-<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/02/01/133_clone_graph_question.png" style="height: 500px; width: 500px;"></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/4665a14e8275dcebde63ce3942d110d2.png" style="height: 500px; width: 500px;"></p>
 
 <pre><strong>输入：</strong>adjList = [[2,4],[1,3],[2,4],[1,3]]
 <strong>输出：</strong>[[2,4],[1,3],[2,4],[1,3]]
@@ -37,7 +37,7 @@
 
 <p><strong>示例 2：</strong></p>
 
-<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/02/01/graph.png" style="height: 148px; width: 163px;"></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/8cfbd9dc508e987b546cd2f0fd792014.png" style="height: 148px; width: 163px;"></p>
 
 <pre><strong>输入：</strong>adjList = [[]]
 <strong>输出：</strong>[[]]
@@ -53,7 +53,7 @@
 
 <p><strong>示例 4：</strong></p>
 
-<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/02/01/graph-1.png" style="height: 133px; width: 272px;"></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/dc82e82c9a0f178d4d1b6f5a85353dee.png" style="height: 133px; width: 272px;"></p>
 
 <pre><strong>输入：</strong>adjList = [[2],[1]]
 <strong>输出：</strong>[[2],[1]]</pre>
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/8.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/8.exercises/solution.md"
index 0fd25b810..ecb692b20 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/8.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/8.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 电话号码的字母组合
 
-<p>给定一个仅包含数字 <code>2-9</code> 的字符串，返回所有它能表示的字母组合。答案可以按 <strong>任意顺序</strong> 返回。</p><p>给出数字到字母的映射如下（与电话按键相同）。注意 1 不对应任何字母。</p><p><img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0017.Letter%20Combinations%20of%20a%20Phone%20Number/images/17_telephone_keypad.png" style="width: 200px;" /></p><p> </p><p><strong>示例 1：</strong></p><pre><strong>输入：</strong>digits = "23"<strong><br />输出：</strong>["ad","ae","af","bd","be","bf","cd","ce","cf"]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>digits = ""<strong><br />输出：</strong>[]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>digits = "2"<strong><br />输出：</strong>["a","b","c"]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>0 <= digits.length <= 4</code></li>	<li><code>digits[i]</code> 是范围 <code>['2', '9']</code> 的一个数字。</li></ul>
+<p>给定一个仅包含数字 <code>2-9</code> 的字符串，返回所有它能表示的字母组合。答案可以按 <strong>任意顺序</strong> 返回。</p><p>给出数字到字母的映射如下（与电话按键相同）。注意 1 不对应任何字母。</p><p><img src="https://img-service.csdnimg.cn/img_convert/71e2c27cd43a6f678c1972f865e982d0.png" style="width: 200px;" /></p><p> </p><p><strong>示例 1：</strong></p><pre><strong>输入：</strong>digits = "23"<strong><br />输出：</strong>["ad","ae","af","bd","be","bf","cd","ce","cf"]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>digits = ""<strong><br />输出：</strong>[]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>digits = "2"<strong><br />输出：</strong>["a","b","c"]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>0 <= digits.length <= 4</code></li>	<li><code>digits[i]</code> 是范围 <code>['2', '9']</code> 的一个数字。</li></ul>
 
 ## template
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/82.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/82.exercises/solution.md"
index 258d3d65d..097b9da70 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/82.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/82.exercises/solution.md"
@@ -21,7 +21,7 @@
 
 <p><strong>示例 1：</strong></p>
 
-<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/01/09/e1.png" style="height: 138px; width: 680px;" /></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/f8f9507766d2b669c1fc4602abb42bcc.png" style="height: 138px; width: 680px;" /></p>
 
 <pre>
 <strong>输入：</strong>head = [[7,null],[13,0],[11,4],[10,2],[1,0]]
@@ -30,7 +30,7 @@
 
 <p><strong>示例 2：</strong></p>
 
-<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/01/09/e2.png" style="height: 111px; width: 680px;" /></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/5b1d9935e44c90100e9e651df9c95804.png" style="height: 111px; width: 680px;" /></p>
 
 <pre>
 <strong>输入：</strong>head = [[1,1],[2,1]]
@@ -39,7 +39,7 @@
 
 <p><strong>示例 3：</strong></p>
 
-<p><strong><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/01/09/e3.png" style="height: 119px; width: 680px;" /></strong></p>
+<p><strong><img alt="" src="https://img-service.csdnimg.cn/img_convert/644c55218eecea6200881f4bea3a3a95.png" style="height: 119px; width: 680px;" /></strong></p>
 
 <pre>
 <strong>输入：</strong>head = [[3,null],[3,0],[3,null]]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/84.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/84.exercises/solution.md"
index 905827313..4b818599d 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/84.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/84.exercises/solution.md"
@@ -16,7 +16,7 @@
 
 <p><strong>示例 1：</strong></p>
 
-<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/12/07/circularlinkedlist.png" style="height: 97px; width: 300px;" /></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/4a18acda10c1606aa5d1132b9de26d61.png" style="height: 97px; width: 300px;" /></p>
 
 <pre>
 <strong>输入：</strong>head = [3,2,0,-4], pos = 1
@@ -26,7 +26,7 @@
 
 <p><strong>示例 2：</strong></p>
 
-<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>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/1a6fcfc68d7340c39151075f7fa53150.png" style="height: 74px; width: 141px;" /></p>
 
 <pre>
 <strong>输入：</strong>head = [1,2], pos = 0
@@ -36,7 +36,7 @@
 
 <p><strong>示例 3：</strong></p>
 
-<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>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/3039274e08a9385ea77b20a81060ed40.png" style="height: 45px; width: 45px;" /></p>
 
 <pre>
 <strong>输入：</strong>head = [1], pos = -1
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/85.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/85.exercises/solution.md"
index 71d5062a7..b4b36ab2d 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/85.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/85.exercises/solution.md"
@@ -13,7 +13,7 @@
 
 <p><strong>示例 1:</strong></p>
 
-<p><img alt="" src="https://pic.leetcode-cn.com/1626420311-PkUiGI-image.png" style="width: 240px; " /></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/749247317f1c95079a7daa32d6b7da96.png" style="width: 240px; " /></p>
 
 <pre>
 <strong>输入: </strong>head = [1,2,3,4]
@@ -21,7 +21,7 @@
 
 <p><strong>示例 2:</strong></p>
 
-<p><img alt="" src="https://pic.leetcode-cn.com/1626420320-YUiulT-image.png" style="width: 320px; " /></p>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/f425cb8c2d72409c26564abcdb8cb629.png" style="width: 320px; " /></p>
 
 <pre>
 <strong>输入: </strong>head = [1,2,3,4,5]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/87.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/87.exercises/solution.md"
index 44d25d53c..1f63d1410 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/87.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/87.exercises/solution.md"
@@ -2,7 +2,7 @@
 
 <p>对链表进行插入排序。</p>
 
-<p><img alt="" src="https://upload.wikimedia.org/wikipedia/commons/0/0f/Insertion-sort-example-300px.gif"><br>
+<p><img alt="" src="https://img-service.csdnimg.cn/img_convert/9400029b6559a5f16c48610324ceb961.png"><br>
 <small>插入排序的动画演示如上。从第一个元素开始，该链表可以被认为已经部分排序（用黑色表示）。<br>
 每次迭代时，从输入数据中移除一个元素（用红色表示），并原地将其插入到已排好序的链表中。</small></p>
 
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/88.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/88.exercises/solution.md"
index 20b37e585..621b12e63 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/88.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/88.exercises/solution.md"
@@ -11,14 +11,14 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/09/14/sort_list_1.jpg" style="width: 302px; "/>
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/f2b8957105894d4fe9ffe9462e65f8e8.jpeg" style="width: 302px; "/>
 <pre>
 <b>输入：</b>head = [4,2,1,3]
 <b>输出：</b>[1,2,3,4]
 </pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/09/14/sort_list_2.jpg" style="width: 402px; " />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/f10bc169c916b5b0bc8651e5f7e99492.jpeg" style="width: 402px; " />
 <pre>
 <b>输入：</b>head = [-1,5,3,4,0]
 <b>输出：</b>[-1,0,3,4,5]
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/9.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/9.exercises/solution.md"
index 0294458bc..b9f429450 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/9.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/9.exercises/solution.md"
@@ -11,7 +11,7 @@
         <div>
             <p><strong>示例 1：</strong></p>
             <img style="width: 600px; height: 148px;"
-                src="https://assets.leetcode.com/uploads/2021/01/18/uniquebstn3.jpg" alt="">
+                src="https://img-service.csdnimg.cn/img_convert/afa8711beb3c6f3c54d039379f525fb7.jpeg" alt="">
             <pre><strong>输入：</strong>n = 3
 <strong>输出：</strong>[[1,null,2,null,3],[1,null,3,2],[2,1,3],[3,1,null,null,2],[3,2,null,1]]
     </pre>
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/96.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/96.exercises/solution.md"
index 7aa84111b..18e7a1661 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/96.exercises/solution.md"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/96.exercises/solution.md"
@@ -18,7 +18,7 @@
 <p> </p>
 
 <p><strong>示例：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2018/12/25/bst-tree.png" style="width: 189px; height: 178px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/743f55b78d358ff4ba5fbb7d8088a0d9.png" style="width: 189px; height: 178px;" />
 <pre>
 <strong>输入</strong>
 ["BSTIterator", "next", "next", "hasNext", "next", "hasNext", "next", "hasNext", "next", "hasNext"]
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/21.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/21.exercises/solution.md"
index 5df7e22e9..ffe33832e 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/21.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/21.exercises/solution.md"
@@ -13,7 +13,7 @@
     <div class="original__bRMd">
         <div>
             <p><strong>示例：</strong></p><img
-                src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0037.Sudoku%20Solver/images/250px-sudoku-by-l2g-20050714svg.png" />
+                src="https://img-service.csdnimg.cn/img_convert/ed59800c64b76b1efa62aa77747f5330.png" />
             <pre><strong>输入：</strong>board = 
     [["5","3",".",".","7",".",".",".","."],
     ["6",".",".","1","9","5",".",".","."],
@@ -37,7 +37,7 @@
 <strong>解释：</strong>输入的数独如上图所示，唯一有效的解决方案如下所示：
 <p> </p>   
 </pre>
-            <img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0037.Sudoku%20Solver/images/250px-sudoku-by-l2g-20050714_solutionsvg.png"
+            <img src="https://img-service.csdnimg.cn/img_convert/3d74b48c1652fc4320bc5986162756f0.png"
                 style="height:250px; width:250px" />
 
             <p> </p>
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/22.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/22.exercises/solution.md"
index e46115342..bee0dee40 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/22.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/22.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 接雨水
 
-<p>给定 <em>n</em> 个非负整数表示每个宽度为 1 的柱子的高度图，计算按此排列的柱子，下雨之后能接多少雨水。</p><p> </p><p><strong>示例 1：</strong></p><p><img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0042.Trapping%20Rain%20Water/images/rainwatertrap.png" style="height: 161px; width: 412px;" /></p><pre><strong>输入：</strong>height = [0,1,0,2,1,0,1,3,2,1,2,1]<strong><br />输出：</strong>6<strong><br />解释：</strong>上面是由数组 [0,1,0,2,1,0,1,3,2,1,2,1] 表示的高度图，在这种情况下，可以接 6 个单位的雨水（蓝色部分表示雨水）。 </pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>height = [4,2,0,3,2,5]<strong><br />输出：</strong>9</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>n == height.length</code></li>	<li><code>0 <= n <= 3 * 10<sup>4</sup></code></li>	<li><code>0 <= height[i] <= 10<sup>5</sup></code></li></ul>
+<p>给定 <em>n</em> 个非负整数表示每个宽度为 1 的柱子的高度图，计算按此排列的柱子，下雨之后能接多少雨水。</p><p> </p><p><strong>示例 1：</strong></p><p><img src="https://img-service.csdnimg.cn/img_convert/eb3d1efe3faa6dfe31363f4009af2a48.png" style="height: 161px; width: 412px;" /></p><pre><strong>输入：</strong>height = [0,1,0,2,1,0,1,3,2,1,2,1]<strong><br />输出：</strong>6<strong><br />解释：</strong>上面是由数组 [0,1,0,2,1,0,1,3,2,1,2,1] 表示的高度图，在这种情况下，可以接 6 个单位的雨水（蓝色部分表示雨水）。 </pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>height = [4,2,0,3,2,5]<strong><br />输出：</strong>9</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>n == height.length</code></li>	<li><code>0 <= n <= 3 * 10<sup>4</sup></code></li>	<li><code>0 <= height[i] <= 10<sup>5</sup></code></li></ul>
 
 以下程序实现了这一功能，请你填补空白处的内容：
 
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/23.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/23.exercises/solution.md"
index 289802c52..7f1166212 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/23.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/23.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 柱状图中最大的矩形
 
-<p>给定 <em>n</em> 个非负整数，用来表示柱状图中各个柱子的高度。每个柱子彼此相邻，且宽度为 1 。</p><p>求在该柱状图中，能够勾勒出来的矩形的最大面积。</p><p>&nbsp;</p><p><img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0084.Largest%20Rectangle%20in%20Histogram/images/histogram.png"></p><p><small>以上是柱状图的示例，其中每个柱子的宽度为 1，给定的高度为&nbsp;<code>[2,1,5,6,2,3]</code>。</small></p><p>&nbsp;</p><p><img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0084.Largest%20Rectangle%20in%20Histogram/images/histogram_area.png"></p><p><small>图中阴影部分为所能勾勒出的最大矩形面积，其面积为&nbsp;<code>10</code>&nbsp;个单位。</small></p><p>&nbsp;</p><p><strong>示例:</strong></p><pre><strong>输入:</strong> [2,1,5,6,2,3]<strong><br />输出:</strong> 10</pre>
+<p>给定 <em>n</em> 个非负整数，用来表示柱状图中各个柱子的高度。每个柱子彼此相邻，且宽度为 1 。</p><p>求在该柱状图中，能够勾勒出来的矩形的最大面积。</p><p>&nbsp;</p><p><img src="https://img-service.csdnimg.cn/img_convert/947ba982417b598ee8de378ac4b1c2bf.png"></p><p><small>以上是柱状图的示例，其中每个柱子的宽度为 1，给定的高度为&nbsp;<code>[2,1,5,6,2,3]</code>。</small></p><p>&nbsp;</p><p><img src="https://img-service.csdnimg.cn/img_convert/2873fce06be97533e2bc5b5384510f67.png"></p><p><small>图中阴影部分为所能勾勒出的最大矩形面积，其面积为&nbsp;<code>10</code>&nbsp;个单位。</small></p><p>&nbsp;</p><p><strong>示例:</strong></p><pre><strong>输入:</strong> [2,1,5,6,2,3]<strong><br />输出:</strong> 10</pre>
 
 以下程序实现了这一功能，请你填补空白处的内容：
 
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/25.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/25.exercises/solution.md"
index 9e8a96489..a9bd09122 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/25.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/25.exercises/solution.md"
@@ -10,7 +10,7 @@
     <div class="original__bRMd">
         <div>
             <p><strong>示例 1：</strong></p>
-            <img style="width: 600px; height: 268px;" src="https://assets.leetcode.com/uploads/2020/11/13/queens.jpg"
+            <img style="width: 600px; height: 268px;" src="https://img-service.csdnimg.cn/img_convert/cc74a8b59b9a8fe64bb7a741774c2ad1.jpeg"
                 alt="">
             <pre><strong>输入：</strong>n = 4
 <strong>输出：</strong>2
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/26.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/26.exercises/solution.md"
index c59fc9115..db3d9b796 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/26.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/26.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 最大矩形
 
-<p>给定一个仅包含 <code>0</code> 和 <code>1</code> 、大小为 <code>rows x cols</code> 的二维二进制矩阵，找出只包含 <code>1</code> 的最大矩形，并返回其面积。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0085.Maximal%20Rectangle/images/maximal.jpg" style="width: 402px; height: 322px;" /><pre><strong>输入：</strong>matrix = [["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"],["1","0","0","1","0"]]<strong><br />输出：</strong>6<strong><br />解释：</strong>最大矩形如上图所示。</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>matrix = []<strong><br />输出：</strong>0</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>matrix = [["0"]]<strong><br />输出：</strong>0</pre><p><strong>示例 4：</strong></p><pre><strong>输入：</strong>matrix = [["1"]]<strong><br />输出：</strong>1</pre><p><strong>示例 5：</strong></p><pre><strong>输入：</strong>matrix = [["0","0"]]<strong><br />输出：</strong>0</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>rows == matrix.length</code></li>	<li><code>cols == matrix[0].length</code></li>	<li><code>0 <= row, cols <= 200</code></li>	<li><code>matrix[i][j]</code> 为 <code>'0'</code> 或 <code>'1'</code></li></ul>
+<p>给定一个仅包含 <code>0</code> 和 <code>1</code> 、大小为 <code>rows x cols</code> 的二维二进制矩阵，找出只包含 <code>1</code> 的最大矩形，并返回其面积。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/52f17607758af8beae7a87191bff1795.jpeg" style="width: 402px; height: 322px;" /><pre><strong>输入：</strong>matrix = [["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"],["1","0","0","1","0"]]<strong><br />输出：</strong>6<strong><br />解释：</strong>最大矩形如上图所示。</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>matrix = []<strong><br />输出：</strong>0</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>matrix = [["0"]]<strong><br />输出：</strong>0</pre><p><strong>示例 4：</strong></p><pre><strong>输入：</strong>matrix = [["1"]]<strong><br />输出：</strong>1</pre><p><strong>示例 5：</strong></p><pre><strong>输入：</strong>matrix = [["0","0"]]<strong><br />输出：</strong>0</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>rows == matrix.length</code></li>	<li><code>cols == matrix[0].length</code></li>	<li><code>0 <= row, cols <= 200</code></li>	<li><code>matrix[i][j]</code> 为 <code>'0'</code> 或 <code>'1'</code></li></ul>
 
 以下程序实现了这一功能，请你填补空白处的内容：
 
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/30.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/30.exercises/solution.md"
index 5748f4a9f..fe689776d 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/30.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/30.exercises/solution.md"
@@ -1,6 +1,6 @@
 # N 皇后
 
-<p><strong>n 皇后问题</strong> 研究的是如何将 <code>n</code> 个皇后放置在 <code>n×n</code> 的棋盘上，并且使皇后彼此之间不能相互攻击。</p><p>给你一个整数 <code>n</code> ，返回所有不同的 <strong>n<em> </em>皇后问题</strong> 的解决方案。</p><div class="original__bRMd"><div><p>每一种解法包含一个不同的 <strong>n 皇后问题</strong> 的棋子放置方案，该方案中 <code>'Q'</code> 和 <code>'.'</code> 分别代表了皇后和空位。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://assets.leetcode.com/uploads/2020/11/13/queens.jpg" style="width: 600px; height: 268px;" /><pre><strong>输入：</strong>n = 4<strong><br />输出：</strong>[[".Q..","...Q","Q...","..Q."],["..Q.","Q...","...Q",".Q.."]]<strong><br />解释：</strong>如上图所示，4 皇后问题存在两个不同的解法。</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>n = 1<strong><br />输出：</strong>[["Q"]]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>1 <= n <= 9</code></li>	<li>皇后彼此不能相互攻击，也就是说：任何两个皇后都不能处于同一条横行、纵行或斜线上。</li></ul></div></div>
+<p><strong>n 皇后问题</strong> 研究的是如何将 <code>n</code> 个皇后放置在 <code>n×n</code> 的棋盘上，并且使皇后彼此之间不能相互攻击。</p><p>给你一个整数 <code>n</code> ，返回所有不同的 <strong>n<em> </em>皇后问题</strong> 的解决方案。</p><div class="original__bRMd"><div><p>每一种解法包含一个不同的 <strong>n 皇后问题</strong> 的棋子放置方案，该方案中 <code>'Q'</code> 和 <code>'.'</code> 分别代表了皇后和空位。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/cc74a8b59b9a8fe64bb7a741774c2ad1.jpeg" style="width: 600px; height: 268px;" /><pre><strong>输入：</strong>n = 4<strong><br />输出：</strong>[[".Q..","...Q","Q...","..Q."],["..Q.","Q...","...Q",".Q.."]]<strong><br />解释：</strong>如上图所示，4 皇后问题存在两个不同的解法。</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>n = 1<strong><br />输出：</strong>[["Q"]]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>1 <= n <= 9</code></li>	<li>皇后彼此不能相互攻击，也就是说：任何两个皇后都不能处于同一条横行、纵行或斜线上。</li></ul></div></div>
 
 以下程序实现了这一功能，请你填补空白处的内容：
 
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/32.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/32.exercises/solution.md"
index 445edc9a6..43dd3fc3b 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/32.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/32.exercises/solution.md"
@@ -1,6 +1,6 @@
 # K 个一组翻转链表
 
-<p>给你一个链表，每 <em>k </em>个节点一组进行翻转，请你返回翻转后的链表。</p><p><em>k </em>是一个正整数，它的值小于或等于链表的长度。</p><p>如果节点总数不是 <em>k </em>的整数倍，那么请将最后剩余的节点保持原有顺序。</p><p><strong>进阶：</strong></p><ul>	<li>你可以设计一个只使用常数额外空间的算法来解决此问题吗？</li>	<li><strong>你不能只是单纯的改变节点内部的值</strong>，而是需要实际进行节点交换。</li></ul><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0025.Reverse%20Nodes%20in%20k-Group/images/reverse_ex1.jpg" style="width: 542px; height: 222px;" /><pre><strong>输入：</strong>head = [1,2,3,4,5], k = 2<strong><br />输出：</strong>[2,1,4,3,5]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0025.Reverse%20Nodes%20in%20k-Group/images/reverse_ex2.jpg" style="width: 542px; height: 222px;" /><pre><strong>输入：</strong>head = [1,2,3,4,5], k = 3<strong><br />输出：</strong>[3,2,1,4,5]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>head = [1,2,3,4,5], k = 1<strong><br />输出：</strong>[1,2,3,4,5]</pre><p><strong>示例 4：</strong></p><pre><strong>输入：</strong>head = [1], k = 1<strong><br />输出：</strong>[1]</pre><ul></ul><p><strong>提示：</strong></p><ul>	<li>列表中节点的数量在范围 <code>sz</code> 内</li>	<li><code>1 <= sz <= 5000</code></li>	<li><code>0 <= Node.val <= 1000</code></li>	<li><code>1 <= k <= sz</code></li></ul>
+<p>给你一个链表，每 <em>k </em>个节点一组进行翻转，请你返回翻转后的链表。</p><p><em>k </em>是一个正整数，它的值小于或等于链表的长度。</p><p>如果节点总数不是 <em>k </em>的整数倍，那么请将最后剩余的节点保持原有顺序。</p><p><strong>进阶：</strong></p><ul>	<li>你可以设计一个只使用常数额外空间的算法来解决此问题吗？</li>	<li><strong>你不能只是单纯的改变节点内部的值</strong>，而是需要实际进行节点交换。</li></ul><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/73746d9eacbf48526f3aa7f3051d929a.jpeg" style="width: 542px; height: 222px;" /><pre><strong>输入：</strong>head = [1,2,3,4,5], k = 2<strong><br />输出：</strong>[2,1,4,3,5]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/202a5b66c99b0dba832f105fae9a47ce.jpeg" style="width: 542px; height: 222px;" /><pre><strong>输入：</strong>head = [1,2,3,4,5], k = 3<strong><br />输出：</strong>[3,2,1,4,5]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>head = [1,2,3,4,5], k = 1<strong><br />输出：</strong>[1,2,3,4,5]</pre><p><strong>示例 4：</strong></p><pre><strong>输入：</strong>head = [1], k = 1<strong><br />输出：</strong>[1]</pre><ul></ul><p><strong>提示：</strong></p><ul>	<li>列表中节点的数量在范围 <code>sz</code> 内</li>	<li><code>1 <= sz <= 5000</code></li>	<li><code>0 <= Node.val <= 1000</code></li>	<li><code>1 <= k <= sz</code></li></ul>
 
 以下程序实现了这一功能，请你填补空白处的内容：
 
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/43.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/43.exercises/solution.md"
index 6076c4909..23b2f4c06 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/43.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/43.exercises/solution.md"
@@ -9,14 +9,14 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/10/13/exx1.jpg" style="width: 322px; height: 182px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/ca0d0d9f728f2aeda1976de9b08940e5.jpeg" style="width: 322px; height: 182px;" />
 <pre>
 <strong>输入：</strong>root = [1,2,3]
 <strong>输出：</strong>6
 <strong>解释：</strong>最优路径是 2 -> 1 -> 3 ，路径和为 2 + 1 + 3 = 6</pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/10/13/exx2.jpg" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/730fd58fb57c0fbc6d5f77b18e9d6b50.jpeg" />
 <pre>
 <strong>输入：</strong>root = [-10,9,20,null,null,15,7]
 <strong>输出：</strong>42
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/49.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/49.exercises/solution.md"
index 33c073677..64070ab0f 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/49.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/49.exercises/solution.md"
@@ -5,14 +5,14 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/25/plane1.jpg" style="width: 300px; height: 294px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/69c636b932676fa16d04cf33e5936743.jpeg" style="width: 300px; height: 294px;" />
 <pre>
 <strong>输入：</strong>points = [[1,1],[2,2],[3,3]]
 <strong>输出：</strong>3
 </pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/25/plane2.jpg" style="width: 300px; height: 294px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/e969e8a2cebf3a9d164492986f185ad3.jpeg" style="width: 300px; height: 294px;" />
 <pre>
 <strong>输入：</strong>points = [[1,1],[3,2],[5,3],[4,1],[2,3],[1,4]]
 <strong>输出：</strong>4
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/54.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/54.exercises/solution.md"
index 3b47be88b..fb1453059 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/54.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/54.exercises/solution.md"
@@ -7,14 +7,14 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/11/07/search1.jpg" style="width: 322px; height: 322px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/3c58915d280f9462e912c68fbe6cc128.jpeg" style="width: 322px; height: 322px;" />
 <pre>
 <strong>输入：</strong>board = [["o","a","a","n"],["e","t","a","e"],["i","h","k","r"],["i","f","l","v"]], words = ["oath","pea","eat","rain"]
 <strong>输出：</strong>["eat","oath"]
 </pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/11/07/search2.jpg" style="width: 162px; height: 162px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/2799340eb0a16624ef37341b8ab15fd9.jpeg" style="width: 162px; height: 162px;" />
 <pre>
 <strong>输入：</strong>board = [["a","b"],["c","d"]], words = ["abcb"]
 <strong>输出：</strong>[]
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/56.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/56.exercises/solution.md"
index c3286e1ca..7921c6d76 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/56.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/56.exercises/solution.md"
@@ -17,7 +17,7 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/12/01/merged.jpg" style="width: 800px; height: 331px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/9e262d6191741087234d501132cd7cd7.jpeg" style="width: 800px; height: 331px;" />
 <pre>
 <strong>输入：</strong>buildings = [[2,9,10],[3,7,15],[5,12,12],[15,20,10],[19,24,8]]
 <strong>输出：</strong>[[2,10],[3,15],[7,12],[12,0],[15,10],[20,8],[24,0]]
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/63.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/63.exercises/solution.md"
index 36524d2a9..2eb450c1f 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/63.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/63.exercises/solution.md"
@@ -9,7 +9,7 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/09/15/serdeser.jpg" style="width: 442px; height: 324px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/9387977615b7e602406be82d7d4452b9.jpeg" style="width: 442px; height: 324px;" />
 <pre>
 <strong>输入：</strong>root = [1,2,3,null,null,4,5]
 <strong>输出：</strong>[1,2,3,null,null,4,5]
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/69.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/69.exercises/solution.md"
index 88cb6e09d..3f25e39da 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/69.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/69.exercises/solution.md"
@@ -7,14 +7,14 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/01/05/grid1.jpg" style="width: 242px; height: 242px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/d436ea72ef06c6038b50f729e3e23740.jpeg" style="width: 242px; height: 242px;" />
 <pre>
 <strong>输入：</strong>matrix = [[9,9,4],[6,6,8],[2,1,1]]
 <strong>输出：</strong>4 
 <strong>解释：</strong>最长递增路径为 <code>[1, 2, 6, 9]</code>。</pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/01/27/tmp-grid.jpg" style="width: 253px; height: 253px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/d467675b15c40a7cab7b64937f413672.jpeg" style="width: 253px; height: 253px;" />
 <pre>
 <strong>输入：</strong>matrix = [[3,4,5],[3,2,6],[2,2,1]]
 <strong>输出：</strong>4 
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/71.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/71.exercises/solution.md"
index 6d6563304..ac968417a 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/71.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/71.exercises/solution.md"
@@ -9,21 +9,21 @@
 <p>&nbsp;</p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/03/14/selfcross1-plane.jpg" style="width: 400px; height: 435px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/8ff63b9228149b90de12438778363e72.jpeg" style="width: 400px; height: 435px;" />
 <pre>
 <strong>输入：</strong>distance = [2,1,1,2]
 <strong>输出：</strong>true
 </pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/03/14/selfcross2-plane.jpg" style="width: 400px; height: 435px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/61bb0e4736e54f12fc1585be35dc8b92.jpeg" style="width: 400px; height: 435px;" />
 <pre>
 <strong>输入：</strong>distance = [1,2,3,4]
 <strong>输出：</strong>false
 </pre>
 
 <p><strong>示例 3：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/03/14/selfcross3-plane.jpg" style="width: 400px; height: 435px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/bdefbc868dc738985c3e5a16ec3225f5.jpeg" style="width: 400px; height: 435px;" />
 <pre>
 <strong>输入：</strong>distance = [1,1,1,1]
 <strong>输出：</strong>true</pre>
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/75.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/75.exercises/solution.md"
index 2de116311..2ebcb0066 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/75.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/75.exercises/solution.md"
@@ -7,7 +7,7 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/03/18/sum-grid.jpg" style="width: 255px; height: 176px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/36c6ba4d37c75b0d1bc5cdf1a7801601.jpeg" style="width: 255px; height: 176px;" />
 <pre>
 <strong>输入：</strong>matrix = [[1,0,1],[0,-2,3]], k = 2
 <strong>输出：</strong>2
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/76.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/76.exercises/solution.md"
index da0da4b58..64251c968 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/76.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/76.exercises/solution.md"
@@ -4,7 +4,7 @@
 
 <p>每个矩形用左下角的点和右上角的点的坐标来表示。例如，&nbsp;一个单位正方形可以表示为 [1,1,2,2]。&nbsp;( 左下角的点的坐标为 (1, 1) 以及右上角的点的坐标为 (2, 2) )。</p>
 
-<p><img src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/10/22/rectangle_perfect.gif"></p>
+<p><img src="https://img-service.csdnimg.cn/img_convert/ac6a416aa69a24c68cb53ccb4beb5f09.gif"></p>
 
 <p><strong>示例 1:</strong></p>
 
@@ -21,7 +21,7 @@
 
 <p>&nbsp;</p>
 
-<p><img src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/10/22/rectangle_separated.gif"></p>
+<p><img src="https://img-service.csdnimg.cn/img_convert/a27dd8e04a6ac75b023c37ba7abddb51.gif"></p>
 
 <p><strong>示例&nbsp;2:</strong></p>
 
@@ -37,7 +37,7 @@
 
 <p>&nbsp;</p>
 
-<p><img src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/10/22/rectangle_hole.gif"></p>
+<p><img src="https://img-service.csdnimg.cn/img_convert/ea4f94b8b331431082e53e87c067d577.gif"></p>
 
 <p><strong>示例 3:</strong></p>
 
@@ -53,7 +53,7 @@
 
 <p>&nbsp;</p>
 
-<p><img src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/10/22/rectangle_intersect.gif"></p>
+<p><img src="https://img-service.csdnimg.cn/img_convert/09edb1b03a9486a1631f8d58dc986d6e.gif"></p>
 
 <p><strong>示例 4:</strong></p>
 
diff --git "a/data/3.dailycode\351\253\230\351\230\266/2.java/1.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/2.java/1.exercises/solution.md"
index 412bbd577..a80aa8d08 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/2.java/1.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/2.java/1.exercises/solution.md"
@@ -13,7 +13,7 @@
     <div class="original__bRMd">
         <div>
             <p><strong>示例：</strong></p><img
-                src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0037.Sudoku%20Solver/images/250px-sudoku-by-l2g-20050714svg.png" />
+                src="https://img-service.csdnimg.cn/img_convert/ed59800c64b76b1efa62aa77747f5330.png" />
             <pre><strong>输入：</strong>board = 
     [["5","3",".",".","7",".",".",".","."],
     ["6",".",".","1","9","5",".",".","."],
@@ -37,7 +37,7 @@
 <strong>解释：</strong>输入的数独如上图所示，唯一有效的解决方案如下所示：
 <p> </p>   
 </pre>
-            <img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0037.Sudoku%20Solver/images/250px-sudoku-by-l2g-20050714_solutionsvg.png"
+            <img src="https://img-service.csdnimg.cn/img_convert/3d74b48c1652fc4320bc5986162756f0.png"
                 style="height:250px; width:250px" />
 
             <p> </p>
diff --git "a/data/3.dailycode\351\253\230\351\230\266/2.java/10.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/2.java/10.exercises/solution.md"
index 3f00ef107..e46529d0c 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/2.java/10.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/2.java/10.exercises/solution.md"
@@ -1,6 +1,6 @@
 # N 皇后
 
-<p><strong>n 皇后问题</strong> 研究的是如何将 <code>n</code> 个皇后放置在 <code>n×n</code> 的棋盘上，并且使皇后彼此之间不能相互攻击。</p><p>给你一个整数 <code>n</code> ，返回所有不同的 <strong>n<em> </em>皇后问题</strong> 的解决方案。</p><div class="original__bRMd"><div><p>每一种解法包含一个不同的 <strong>n 皇后问题</strong> 的棋子放置方案，该方案中 <code>'Q'</code> 和 <code>'.'</code> 分别代表了皇后和空位。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://assets.leetcode.com/uploads/2020/11/13/queens.jpg" style="width: 600px; height: 268px;" /><pre><strong>输入：</strong>n = 4<strong><br />输出：</strong>[[".Q..","...Q","Q...","..Q."],["..Q.","Q...","...Q",".Q.."]]<strong><br />解释：</strong>如上图所示，4 皇后问题存在两个不同的解法。</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>n = 1<strong><br />输出：</strong>[["Q"]]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>1 <= n <= 9</code></li>	<li>皇后彼此不能相互攻击，也就是说：任何两个皇后都不能处于同一条横行、纵行或斜线上。</li></ul></div></div>
+<p><strong>n 皇后问题</strong> 研究的是如何将 <code>n</code> 个皇后放置在 <code>n×n</code> 的棋盘上，并且使皇后彼此之间不能相互攻击。</p><p>给你一个整数 <code>n</code> ，返回所有不同的 <strong>n<em> </em>皇后问题</strong> 的解决方案。</p><div class="original__bRMd"><div><p>每一种解法包含一个不同的 <strong>n 皇后问题</strong> 的棋子放置方案，该方案中 <code>'Q'</code> 和 <code>'.'</code> 分别代表了皇后和空位。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/cc74a8b59b9a8fe64bb7a741774c2ad1.jpeg" style="width: 600px; height: 268px;" /><pre><strong>输入：</strong>n = 4<strong><br />输出：</strong>[[".Q..","...Q","Q...","..Q."],["..Q.","Q...","...Q",".Q.."]]<strong><br />解释：</strong>如上图所示，4 皇后问题存在两个不同的解法。</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>n = 1<strong><br />输出：</strong>[["Q"]]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>1 <= n <= 9</code></li>	<li>皇后彼此不能相互攻击，也就是说：任何两个皇后都不能处于同一条横行、纵行或斜线上。</li></ul></div></div>
 
 以下程序实现了这一功能，请你填补空白处内容：
 
diff --git "a/data/3.dailycode\351\253\230\351\230\266/2.java/12.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/2.java/12.exercises/solution.md"
index 9295f87d9..d2e826051 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/2.java/12.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/2.java/12.exercises/solution.md"
@@ -1,6 +1,6 @@
 # K 个一组翻转链表
 
-<p>给你一个链表，每 <em>k </em>个节点一组进行翻转，请你返回翻转后的链表。</p><p><em>k </em>是一个正整数，它的值小于或等于链表的长度。</p><p>如果节点总数不是 <em>k </em>的整数倍，那么请将最后剩余的节点保持原有顺序。</p><p><strong>进阶：</strong></p><ul>	<li>你可以设计一个只使用常数额外空间的算法来解决此问题吗？</li>	<li><strong>你不能只是单纯的改变节点内部的值</strong>，而是需要实际进行节点交换。</li></ul><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0025.Reverse%20Nodes%20in%20k-Group/images/reverse_ex1.jpg" style="width: 542px; height: 222px;" /><pre><strong>输入：</strong>head = [1,2,3,4,5], k = 2<strong><br />输出：</strong>[2,1,4,3,5]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0025.Reverse%20Nodes%20in%20k-Group/images/reverse_ex2.jpg" style="width: 542px; height: 222px;" /><pre><strong>输入：</strong>head = [1,2,3,4,5], k = 3<strong><br />输出：</strong>[3,2,1,4,5]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>head = [1,2,3,4,5], k = 1<strong><br />输出：</strong>[1,2,3,4,5]</pre><p><strong>示例 4：</strong></p><pre><strong>输入：</strong>head = [1], k = 1<strong><br />输出：</strong>[1]</pre><ul></ul><p><strong>提示：</strong></p><ul>	<li>列表中节点的数量在范围 <code>sz</code> 内</li>	<li><code>1 <= sz <= 5000</code></li>	<li><code>0 <= Node.val <= 1000</code></li>	<li><code>1 <= k <= sz</code></li></ul>
+<p>给你一个链表，每 <em>k </em>个节点一组进行翻转，请你返回翻转后的链表。</p><p><em>k </em>是一个正整数，它的值小于或等于链表的长度。</p><p>如果节点总数不是 <em>k </em>的整数倍，那么请将最后剩余的节点保持原有顺序。</p><p><strong>进阶：</strong></p><ul>	<li>你可以设计一个只使用常数额外空间的算法来解决此问题吗？</li>	<li><strong>你不能只是单纯的改变节点内部的值</strong>，而是需要实际进行节点交换。</li></ul><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/73746d9eacbf48526f3aa7f3051d929a.jpeg" style="width: 542px; height: 222px;" /><pre><strong>输入：</strong>head = [1,2,3,4,5], k = 2<strong><br />输出：</strong>[2,1,4,3,5]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/202a5b66c99b0dba832f105fae9a47ce.jpeg" style="width: 542px; height: 222px;" /><pre><strong>输入：</strong>head = [1,2,3,4,5], k = 3<strong><br />输出：</strong>[3,2,1,4,5]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>head = [1,2,3,4,5], k = 1<strong><br />输出：</strong>[1,2,3,4,5]</pre><p><strong>示例 4：</strong></p><pre><strong>输入：</strong>head = [1], k = 1<strong><br />输出：</strong>[1]</pre><ul></ul><p><strong>提示：</strong></p><ul>	<li>列表中节点的数量在范围 <code>sz</code> 内</li>	<li><code>1 <= sz <= 5000</code></li>	<li><code>0 <= Node.val <= 1000</code></li>	<li><code>1 <= k <= sz</code></li></ul>
 
 以下程序实现了这一功能，请你填补空白处内容：
 
diff --git "a/data/3.dailycode\351\253\230\351\230\266/2.java/2.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/2.java/2.exercises/solution.md"
index 4b3ada41e..29a3be730 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/2.java/2.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/2.java/2.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 接雨水
 
-<p>给定 <em>n</em> 个非负整数表示每个宽度为 1 的柱子的高度图，计算按此排列的柱子，下雨之后能接多少雨水。</p><p> </p><p><strong>示例 1：</strong></p><p><img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0042.Trapping%20Rain%20Water/images/rainwatertrap.png" style="height: 161px; width: 412px;" /></p><pre><strong>输入：</strong>height = [0,1,0,2,1,0,1,3,2,1,2,1]<strong><br />输出：</strong>6<strong><br />解释：</strong>上面是由数组 [0,1,0,2,1,0,1,3,2,1,2,1] 表示的高度图，在这种情况下，可以接 6 个单位的雨水（蓝色部分表示雨水）。 </pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>height = [4,2,0,3,2,5]<strong><br />输出：</strong>9</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>n == height.length</code></li>	<li><code>0 <= n <= 3 * 10<sup>4</sup></code></li>	<li><code>0 <= height[i] <= 10<sup>5</sup></code></li></ul>
+<p>给定 <em>n</em> 个非负整数表示每个宽度为 1 的柱子的高度图，计算按此排列的柱子，下雨之后能接多少雨水。</p><p> </p><p><strong>示例 1：</strong></p><p><img src="https://img-service.csdnimg.cn/img_convert/eb3d1efe3faa6dfe31363f4009af2a48.png" style="height: 161px; width: 412px;" /></p><pre><strong>输入：</strong>height = [0,1,0,2,1,0,1,3,2,1,2,1]<strong><br />输出：</strong>6<strong><br />解释：</strong>上面是由数组 [0,1,0,2,1,0,1,3,2,1,2,1] 表示的高度图，在这种情况下，可以接 6 个单位的雨水（蓝色部分表示雨水）。 </pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>height = [4,2,0,3,2,5]<strong><br />输出：</strong>9</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>n == height.length</code></li>	<li><code>0 <= n <= 3 * 10<sup>4</sup></code></li>	<li><code>0 <= height[i] <= 10<sup>5</sup></code></li></ul>
 
 以下程序实现了这一功能，请你填补空白处内容：
 
diff --git "a/data/3.dailycode\351\253\230\351\230\266/2.java/23.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/2.java/23.exercises/solution.md"
index 24727689f..4d17474e8 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/2.java/23.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/2.java/23.exercises/solution.md"
@@ -9,14 +9,14 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/10/13/exx1.jpg" style="width: 322px; height: 182px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/ca0d0d9f728f2aeda1976de9b08940e5.jpeg" style="width: 322px; height: 182px;" />
 <pre>
 <strong>输入：</strong>root = [1,2,3]
 <strong>输出：</strong>6
 <strong>解释：</strong>最优路径是 2 -> 1 -> 3 ，路径和为 2 + 1 + 3 = 6</pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/10/13/exx2.jpg" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/730fd58fb57c0fbc6d5f77b18e9d6b50.jpeg" />
 <pre>
 <strong>输入：</strong>root = [-10,9,20,null,null,15,7]
 <strong>输出：</strong>42
diff --git "a/data/3.dailycode\351\253\230\351\230\266/2.java/29.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/2.java/29.exercises/solution.md"
index 5e8775341..11c2741ef 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/2.java/29.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/2.java/29.exercises/solution.md"
@@ -5,14 +5,14 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/25/plane1.jpg" style="width: 300px; height: 294px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/69c636b932676fa16d04cf33e5936743.jpeg" style="width: 300px; height: 294px;" />
 <pre>
 <strong>输入：</strong>points = [[1,1],[2,2],[3,3]]
 <strong>输出：</strong>3
 </pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/25/plane2.jpg" style="width: 300px; height: 294px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/e969e8a2cebf3a9d164492986f185ad3.jpeg" style="width: 300px; height: 294px;" />
 <pre>
 <strong>输入：</strong>points = [[1,1],[3,2],[5,3],[4,1],[2,3],[1,4]]
 <strong>输出：</strong>4
diff --git "a/data/3.dailycode\351\253\230\351\230\266/2.java/3.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/2.java/3.exercises/solution.md"
index 763c64572..7b2cc9d3a 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/2.java/3.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/2.java/3.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 柱状图中最大的矩形
 
-<p>给定 <em>n</em> 个非负整数，用来表示柱状图中各个柱子的高度。每个柱子彼此相邻，且宽度为 1 。</p><p>求在该柱状图中，能够勾勒出来的矩形的最大面积。</p><p>&nbsp;</p><p><img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0084.Largest%20Rectangle%20in%20Histogram/images/histogram.png"></p><p><small>以上是柱状图的示例，其中每个柱子的宽度为 1，给定的高度为&nbsp;<code>[2,1,5,6,2,3]</code>。</small></p><p>&nbsp;</p><p><img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0084.Largest%20Rectangle%20in%20Histogram/images/histogram_area.png"></p><p><small>图中阴影部分为所能勾勒出的最大矩形面积，其面积为&nbsp;<code>10</code>&nbsp;个单位。</small></p><p>&nbsp;</p><p><strong>示例:</strong></p><pre><strong>输入:</strong> [2,1,5,6,2,3]<strong><br />输出:</strong> 10</pre>
+<p>给定 <em>n</em> 个非负整数，用来表示柱状图中各个柱子的高度。每个柱子彼此相邻，且宽度为 1 。</p><p>求在该柱状图中，能够勾勒出来的矩形的最大面积。</p><p>&nbsp;</p><p><img src="https://img-service.csdnimg.cn/img_convert/947ba982417b598ee8de378ac4b1c2bf.png"></p><p><small>以上是柱状图的示例，其中每个柱子的宽度为 1，给定的高度为&nbsp;<code>[2,1,5,6,2,3]</code>。</small></p><p>&nbsp;</p><p><img src="https://img-service.csdnimg.cn/img_convert/2873fce06be97533e2bc5b5384510f67.png"></p><p><small>图中阴影部分为所能勾勒出的最大矩形面积，其面积为&nbsp;<code>10</code>&nbsp;个单位。</small></p><p>&nbsp;</p><p><strong>示例:</strong></p><pre><strong>输入:</strong> [2,1,5,6,2,3]<strong><br />输出:</strong> 10</pre>
 
 以下程序实现了这一功能，请你填补空白处内容：
 
diff --git "a/data/3.dailycode\351\253\230\351\230\266/2.java/34.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/2.java/34.exercises/solution.md"
index 8062a438d..27fdd36da 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/2.java/34.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/2.java/34.exercises/solution.md"
@@ -7,14 +7,14 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/11/07/search1.jpg" style="width: 322px; height: 322px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/3c58915d280f9462e912c68fbe6cc128.jpeg" style="width: 322px; height: 322px;" />
 <pre>
 <strong>输入：</strong>board = [["o","a","a","n"],["e","t","a","e"],["i","h","k","r"],["i","f","l","v"]], words = ["oath","pea","eat","rain"]
 <strong>输出：</strong>["eat","oath"]
 </pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/11/07/search2.jpg" style="width: 162px; height: 162px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/2799340eb0a16624ef37341b8ab15fd9.jpeg" style="width: 162px; height: 162px;" />
 <pre>
 <strong>输入：</strong>board = [["a","b"],["c","d"]], words = ["abcb"]
 <strong>输出：</strong>[]
diff --git "a/data/3.dailycode\351\253\230\351\230\266/2.java/36.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/2.java/36.exercises/solution.md"
index d94cce264..67fa49afb 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/2.java/36.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/2.java/36.exercises/solution.md"
@@ -17,7 +17,7 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/12/01/merged.jpg" style="width: 800px; height: 331px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/9e262d6191741087234d501132cd7cd7.jpeg" style="width: 800px; height: 331px;" />
 <pre>
 <strong>输入：</strong>buildings = [[2,9,10],[3,7,15],[5,12,12],[15,20,10],[19,24,8]]
 <strong>输出：</strong>[[2,10],[3,15],[7,12],[12,0],[15,10],[20,8],[24,0]]
diff --git "a/data/3.dailycode\351\253\230\351\230\266/2.java/43.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/2.java/43.exercises/solution.md"
index 5788761a0..fe1f4b9c2 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/2.java/43.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/2.java/43.exercises/solution.md"
@@ -9,7 +9,7 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/09/15/serdeser.jpg" style="width: 442px; height: 324px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/9387977615b7e602406be82d7d4452b9.jpeg" style="width: 442px; height: 324px;" />
 <pre>
 <strong>输入：</strong>root = [1,2,3,null,null,4,5]
 <strong>输出：</strong>[1,2,3,null,null,4,5]
diff --git "a/data/3.dailycode\351\253\230\351\230\266/2.java/49.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/2.java/49.exercises/solution.md"
index 86da387ed..9d3b648de 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/2.java/49.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/2.java/49.exercises/solution.md"
@@ -7,14 +7,14 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/01/05/grid1.jpg" style="width: 242px; height: 242px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/d436ea72ef06c6038b50f729e3e23740.jpeg" style="width: 242px; height: 242px;" />
 <pre>
 <strong>输入：</strong>matrix = [[9,9,4],[6,6,8],[2,1,1]]
 <strong>输出：</strong>4 
 <strong>解释：</strong>最长递增路径为 <code>[1, 2, 6, 9]</code>。</pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/01/27/tmp-grid.jpg" style="width: 253px; height: 253px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/d467675b15c40a7cab7b64937f413672.jpeg" style="width: 253px; height: 253px;" />
 <pre>
 <strong>输入：</strong>matrix = [[3,4,5],[3,2,6],[2,2,1]]
 <strong>输出：</strong>4 
diff --git "a/data/3.dailycode\351\253\230\351\230\266/2.java/5.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/2.java/5.exercises/solution.md"
index 9fa979638..6da5bab9a 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/2.java/5.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/2.java/5.exercises/solution.md"
@@ -10,7 +10,7 @@
     <div class="original__bRMd">
         <div>
             <p><strong>示例 1：</strong></p>
-            <img style="width: 600px; height: 268px;" src="https://assets.leetcode.com/uploads/2020/11/13/queens.jpg"
+            <img style="width: 600px; height: 268px;" src="https://img-service.csdnimg.cn/img_convert/cc74a8b59b9a8fe64bb7a741774c2ad1.jpeg"
                 alt="">
             <pre><strong>输入：</strong>n = 4
 <strong>输出：</strong>2
diff --git "a/data/3.dailycode\351\253\230\351\230\266/2.java/51.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/2.java/51.exercises/solution.md"
index af2ed686f..1212c7e15 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/2.java/51.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/2.java/51.exercises/solution.md"
@@ -9,21 +9,21 @@
 <p>&nbsp;</p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/03/14/selfcross1-plane.jpg" style="width: 400px; height: 435px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/8ff63b9228149b90de12438778363e72.jpeg" style="width: 400px; height: 435px;" />
 <pre>
 <strong>输入：</strong>distance = [2,1,1,2]
 <strong>输出：</strong>true
 </pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/03/14/selfcross2-plane.jpg" style="width: 400px; height: 435px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/61bb0e4736e54f12fc1585be35dc8b92.jpeg" style="width: 400px; height: 435px;" />
 <pre>
 <strong>输入：</strong>distance = [1,2,3,4]
 <strong>输出：</strong>false
 </pre>
 
 <p><strong>示例 3：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/03/14/selfcross3-plane.jpg" style="width: 400px; height: 435px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/bdefbc868dc738985c3e5a16ec3225f5.jpeg" style="width: 400px; height: 435px;" />
 <pre>
 <strong>输入：</strong>distance = [1,1,1,1]
 <strong>输出：</strong>true</pre>
diff --git "a/data/3.dailycode\351\253\230\351\230\266/2.java/55.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/2.java/55.exercises/solution.md"
index 6a32a61d4..d3179a3ed 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/2.java/55.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/2.java/55.exercises/solution.md"
@@ -7,7 +7,7 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/03/18/sum-grid.jpg" style="width: 255px; height: 176px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/36c6ba4d37c75b0d1bc5cdf1a7801601.jpeg" style="width: 255px; height: 176px;" />
 <pre>
 <strong>输入：</strong>matrix = [[1,0,1],[0,-2,3]], k = 2
 <strong>输出：</strong>2
diff --git "a/data/3.dailycode\351\253\230\351\230\266/2.java/57.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/2.java/57.exercises/solution.md"
index 99505a71d..d641ba3bc 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/2.java/57.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/2.java/57.exercises/solution.md"
@@ -4,7 +4,7 @@
 
 <p>每个矩形用左下角的点和右上角的点的坐标来表示。例如，&nbsp;一个单位正方形可以表示为 [1,1,2,2]。&nbsp;( 左下角的点的坐标为 (1, 1) 以及右上角的点的坐标为 (2, 2) )。</p>
 
-<p><img src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/10/22/rectangle_perfect.gif"></p>
+<p><img src="https://img-service.csdnimg.cn/img_convert/ac6a416aa69a24c68cb53ccb4beb5f09.gif"></p>
 
 <p><strong>示例 1:</strong></p>
 
@@ -21,7 +21,7 @@
 
 <p>&nbsp;</p>
 
-<p><img src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/10/22/rectangle_separated.gif"></p>
+<p><img src="https://img-service.csdnimg.cn/img_convert/a27dd8e04a6ac75b023c37ba7abddb51.gif"></p>
 
 <p><strong>示例&nbsp;2:</strong></p>
 
@@ -37,7 +37,7 @@
 
 <p>&nbsp;</p>
 
-<p><img src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/10/22/rectangle_hole.gif"></p>
+<p><img src="https://img-service.csdnimg.cn/img_convert/ea4f94b8b331431082e53e87c067d577.gif"></p>
 
 <p><strong>示例 3:</strong></p>
 
@@ -53,7 +53,7 @@
 
 <p>&nbsp;</p>
 
-<p><img src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/10/22/rectangle_intersect.gif"></p>
+<p><img src="https://img-service.csdnimg.cn/img_convert/09edb1b03a9486a1631f8d58dc986d6e.gif"></p>
 
 <p><strong>示例 4:</strong></p>
 
diff --git "a/data/3.dailycode\351\253\230\351\230\266/2.java/6.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/2.java/6.exercises/solution.md"
index 602d6ca59..e723c2b1b 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/2.java/6.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/2.java/6.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 最大矩形
 
-<p>给定一个仅包含 <code>0</code> 和 <code>1</code> 、大小为 <code>rows x cols</code> 的二维二进制矩阵，找出只包含 <code>1</code> 的最大矩形，并返回其面积。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0085.Maximal%20Rectangle/images/maximal.jpg" style="width: 402px; height: 322px;" /><pre><strong>输入：</strong>matrix = [["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"],["1","0","0","1","0"]]<strong><br />输出：</strong>6<strong><br />解释：</strong>最大矩形如上图所示。</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>matrix = []<strong><br />输出：</strong>0</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>matrix = [["0"]]<strong><br />输出：</strong>0</pre><p><strong>示例 4：</strong></p><pre><strong>输入：</strong>matrix = [["1"]]<strong><br />输出：</strong>1</pre><p><strong>示例 5：</strong></p><pre><strong>输入：</strong>matrix = [["0","0"]]<strong><br />输出：</strong>0</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>rows == matrix.length</code></li>	<li><code>cols == matrix[0].length</code></li>	<li><code>0 <= row, cols <= 200</code></li>	<li><code>matrix[i][j]</code> 为 <code>'0'</code> 或 <code>'1'</code></li></ul>
+<p>给定一个仅包含 <code>0</code> 和 <code>1</code> 、大小为 <code>rows x cols</code> 的二维二进制矩阵，找出只包含 <code>1</code> 的最大矩形，并返回其面积。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/52f17607758af8beae7a87191bff1795.jpeg" style="width: 402px; height: 322px;" /><pre><strong>输入：</strong>matrix = [["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"],["1","0","0","1","0"]]<strong><br />输出：</strong>6<strong><br />解释：</strong>最大矩形如上图所示。</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>matrix = []<strong><br />输出：</strong>0</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>matrix = [["0"]]<strong><br />输出：</strong>0</pre><p><strong>示例 4：</strong></p><pre><strong>输入：</strong>matrix = [["1"]]<strong><br />输出：</strong>1</pre><p><strong>示例 5：</strong></p><pre><strong>输入：</strong>matrix = [["0","0"]]<strong><br />输出：</strong>0</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>rows == matrix.length</code></li>	<li><code>cols == matrix[0].length</code></li>	<li><code>0 <= row, cols <= 200</code></li>	<li><code>matrix[i][j]</code> 为 <code>'0'</code> 或 <code>'1'</code></li></ul>
 
 以下程序实现了这一功能，请你填补空白处内容：
 
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/11.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/11.exercises/solution.md"
index c93b24c05..5a6222c02 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/11.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/11.exercises/solution.md"
@@ -1,6 +1,6 @@
 # N 皇后
 
-<p><strong>n 皇后问题</strong> 研究的是如何将 <code>n</code> 个皇后放置在 <code>n×n</code> 的棋盘上，并且使皇后彼此之间不能相互攻击。</p><p>给你一个整数 <code>n</code> ，返回所有不同的 <strong>n<em> </em>皇后问题</strong> 的解决方案。</p><div class="original__bRMd"><div><p>每一种解法包含一个不同的 <strong>n 皇后问题</strong> 的棋子放置方案，该方案中 <code>'Q'</code> 和 <code>'.'</code> 分别代表了皇后和空位。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://assets.leetcode.com/uploads/2020/11/13/queens.jpg" style="width: 600px; height: 268px;" /><pre><strong>输入：</strong>n = 4<strong><br />输出：</strong>[[".Q..","...Q","Q...","..Q."],["..Q.","Q...","...Q",".Q.."]]<strong><br />解释：</strong>如上图所示，4 皇后问题存在两个不同的解法。</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>n = 1<strong><br />输出：</strong>[["Q"]]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>1 <= n <= 9</code></li>	<li>皇后彼此不能相互攻击，也就是说：任何两个皇后都不能处于同一条横行、纵行或斜线上。</li></ul></div></div>
+<p><strong>n 皇后问题</strong> 研究的是如何将 <code>n</code> 个皇后放置在 <code>n×n</code> 的棋盘上，并且使皇后彼此之间不能相互攻击。</p><p>给你一个整数 <code>n</code> ，返回所有不同的 <strong>n<em> </em>皇后问题</strong> 的解决方案。</p><div class="original__bRMd"><div><p>每一种解法包含一个不同的 <strong>n 皇后问题</strong> 的棋子放置方案，该方案中 <code>'Q'</code> 和 <code>'.'</code> 分别代表了皇后和空位。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/cc74a8b59b9a8fe64bb7a741774c2ad1.jpeg" style="width: 600px; height: 268px;" /><pre><strong>输入：</strong>n = 4<strong><br />输出：</strong>[[".Q..","...Q","Q...","..Q."],["..Q.","Q...","...Q",".Q.."]]<strong><br />解释：</strong>如上图所示，4 皇后问题存在两个不同的解法。</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>n = 1<strong><br />输出：</strong>[["Q"]]</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>1 <= n <= 9</code></li>	<li>皇后彼此不能相互攻击，也就是说：任何两个皇后都不能处于同一条横行、纵行或斜线上。</li></ul></div></div>
 
 以下程序实现了这一功能，请你填补空白处内容：
 
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/13.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/13.exercises/solution.md"
index d980cd19f..f70bcdbb8 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/13.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/13.exercises/solution.md"
@@ -1,6 +1,6 @@
 # K 个一组翻转链表
 
-<p>给你一个链表，每 <em>k </em>个节点一组进行翻转，请你返回翻转后的链表。</p><p><em>k </em>是一个正整数，它的值小于或等于链表的长度。</p><p>如果节点总数不是 <em>k </em>的整数倍，那么请将最后剩余的节点保持原有顺序。</p><p><strong>进阶：</strong></p><ul>	<li>你可以设计一个只使用常数额外空间的算法来解决此问题吗？</li>	<li><strong>你不能只是单纯的改变节点内部的值</strong>，而是需要实际进行节点交换。</li></ul><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0025.Reverse%20Nodes%20in%20k-Group/images/reverse_ex1.jpg" style="width: 542px; height: 222px;" /><pre><strong>输入：</strong>head = [1,2,3,4,5], k = 2<strong><br />输出：</strong>[2,1,4,3,5]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0025.Reverse%20Nodes%20in%20k-Group/images/reverse_ex2.jpg" style="width: 542px; height: 222px;" /><pre><strong>输入：</strong>head = [1,2,3,4,5], k = 3<strong><br />输出：</strong>[3,2,1,4,5]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>head = [1,2,3,4,5], k = 1<strong><br />输出：</strong>[1,2,3,4,5]</pre><p><strong>示例 4：</strong></p><pre><strong>输入：</strong>head = [1], k = 1<strong><br />输出：</strong>[1]</pre><ul></ul><p><strong>提示：</strong></p><ul>	<li>列表中节点的数量在范围 <code>sz</code> 内</li>	<li><code>1 <= sz <= 5000</code></li>	<li><code>0 <= Node.val <= 1000</code></li>	<li><code>1 <= k <= sz</code></li></ul>
+<p>给你一个链表，每 <em>k </em>个节点一组进行翻转，请你返回翻转后的链表。</p><p><em>k </em>是一个正整数，它的值小于或等于链表的长度。</p><p>如果节点总数不是 <em>k </em>的整数倍，那么请将最后剩余的节点保持原有顺序。</p><p><strong>进阶：</strong></p><ul>	<li>你可以设计一个只使用常数额外空间的算法来解决此问题吗？</li>	<li><strong>你不能只是单纯的改变节点内部的值</strong>，而是需要实际进行节点交换。</li></ul><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/73746d9eacbf48526f3aa7f3051d929a.jpeg" style="width: 542px; height: 222px;" /><pre><strong>输入：</strong>head = [1,2,3,4,5], k = 2<strong><br />输出：</strong>[2,1,4,3,5]</pre><p><strong>示例 2：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/202a5b66c99b0dba832f105fae9a47ce.jpeg" style="width: 542px; height: 222px;" /><pre><strong>输入：</strong>head = [1,2,3,4,5], k = 3<strong><br />输出：</strong>[3,2,1,4,5]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>head = [1,2,3,4,5], k = 1<strong><br />输出：</strong>[1,2,3,4,5]</pre><p><strong>示例 4：</strong></p><pre><strong>输入：</strong>head = [1], k = 1<strong><br />输出：</strong>[1]</pre><ul></ul><p><strong>提示：</strong></p><ul>	<li>列表中节点的数量在范围 <code>sz</code> 内</li>	<li><code>1 <= sz <= 5000</code></li>	<li><code>0 <= Node.val <= 1000</code></li>	<li><code>1 <= k <= sz</code></li></ul>
 
 以下程序实现了这一功能，请你填补空白处内容：
 
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/2.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/2.exercises/solution.md"
index cd6e1be59..f98d1792e 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/2.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/2.exercises/solution.md"
@@ -13,7 +13,7 @@
     <div class="original__bRMd">
         <div>
             <p><strong>示例：</strong></p><img
-                src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0037.Sudoku%20Solver/images/250px-sudoku-by-l2g-20050714svg.png" />
+                src="https://img-service.csdnimg.cn/img_convert/ed59800c64b76b1efa62aa77747f5330.png" />
             <pre><strong>输入：</strong>board = 
     [["5","3",".",".","7",".",".",".","."],
     ["6",".",".","1","9","5",".",".","."],
@@ -37,7 +37,7 @@
 <strong>解释：</strong>输入的数独如上图所示，唯一有效的解决方案如下所示：
 <p> </p>   
 </pre>
-            <img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0037.Sudoku%20Solver/images/250px-sudoku-by-l2g-20050714_solutionsvg.png"
+            <img src="https://img-service.csdnimg.cn/img_convert/3d74b48c1652fc4320bc5986162756f0.png"
                 style="height:250px; width:250px" />
 
             <p> </p>
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/24.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/24.exercises/solution.md"
index bb3342d1e..1776786d2 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/24.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/24.exercises/solution.md"
@@ -9,14 +9,14 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/10/13/exx1.jpg" style="width: 322px; height: 182px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/ca0d0d9f728f2aeda1976de9b08940e5.jpeg" style="width: 322px; height: 182px;" />
 <pre>
 <strong>输入：</strong>root = [1,2,3]
 <strong>输出：</strong>6
 <strong>解释：</strong>最优路径是 2 -> 1 -> 3 ，路径和为 2 + 1 + 3 = 6</pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/10/13/exx2.jpg" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/730fd58fb57c0fbc6d5f77b18e9d6b50.jpeg" />
 <pre>
 <strong>输入：</strong>root = [-10,9,20,null,null,15,7]
 <strong>输出：</strong>42
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/3.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/3.exercises/solution.md"
index 485d2174b..e777f5ca7 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/3.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/3.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 接雨水
 
-<p>给定 <em>n</em> 个非负整数表示每个宽度为 1 的柱子的高度图，计算按此排列的柱子，下雨之后能接多少雨水。</p><p> </p><p><strong>示例 1：</strong></p><p><img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0042.Trapping%20Rain%20Water/images/rainwatertrap.png" style="height: 161px; width: 412px;" /></p><pre><strong>输入：</strong>height = [0,1,0,2,1,0,1,3,2,1,2,1]<strong><br />输出：</strong>6<strong><br />解释：</strong>上面是由数组 [0,1,0,2,1,0,1,3,2,1,2,1] 表示的高度图，在这种情况下，可以接 6 个单位的雨水（蓝色部分表示雨水）。 </pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>height = [4,2,0,3,2,5]<strong><br />输出：</strong>9</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>n == height.length</code></li>	<li><code>0 <= n <= 3 * 10<sup>4</sup></code></li>	<li><code>0 <= height[i] <= 10<sup>5</sup></code></li></ul>
+<p>给定 <em>n</em> 个非负整数表示每个宽度为 1 的柱子的高度图，计算按此排列的柱子，下雨之后能接多少雨水。</p><p> </p><p><strong>示例 1：</strong></p><p><img src="https://img-service.csdnimg.cn/img_convert/eb3d1efe3faa6dfe31363f4009af2a48.png" style="height: 161px; width: 412px;" /></p><pre><strong>输入：</strong>height = [0,1,0,2,1,0,1,3,2,1,2,1]<strong><br />输出：</strong>6<strong><br />解释：</strong>上面是由数组 [0,1,0,2,1,0,1,3,2,1,2,1] 表示的高度图，在这种情况下，可以接 6 个单位的雨水（蓝色部分表示雨水）。 </pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>height = [4,2,0,3,2,5]<strong><br />输出：</strong>9</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>n == height.length</code></li>	<li><code>0 <= n <= 3 * 10<sup>4</sup></code></li>	<li><code>0 <= height[i] <= 10<sup>5</sup></code></li></ul>
 
 以下程序实现了这一功能，请你填补空白处内容：
 
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/30.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/30.exercises/solution.md"
index b9692a5aa..cd3582348 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/30.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/30.exercises/solution.md"
@@ -5,14 +5,14 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/25/plane1.jpg" style="width: 300px; height: 294px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/69c636b932676fa16d04cf33e5936743.jpeg" style="width: 300px; height: 294px;" />
 <pre>
 <strong>输入：</strong>points = [[1,1],[2,2],[3,3]]
 <strong>输出：</strong>3
 </pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/25/plane2.jpg" style="width: 300px; height: 294px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/e969e8a2cebf3a9d164492986f185ad3.jpeg" style="width: 300px; height: 294px;" />
 <pre>
 <strong>输入：</strong>points = [[1,1],[3,2],[5,3],[4,1],[2,3],[1,4]]
 <strong>输出：</strong>4
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/35.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/35.exercises/solution.md"
index 0cf0d174d..10becd5f0 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/35.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/35.exercises/solution.md"
@@ -7,14 +7,14 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/11/07/search1.jpg" style="width: 322px; height: 322px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/3c58915d280f9462e912c68fbe6cc128.jpeg" style="width: 322px; height: 322px;" />
 <pre>
 <strong>输入：</strong>board = [["o","a","a","n"],["e","t","a","e"],["i","h","k","r"],["i","f","l","v"]], words = ["oath","pea","eat","rain"]
 <strong>输出：</strong>["eat","oath"]
 </pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/11/07/search2.jpg" style="width: 162px; height: 162px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/2799340eb0a16624ef37341b8ab15fd9.jpeg" style="width: 162px; height: 162px;" />
 <pre>
 <strong>输入：</strong>board = [["a","b"],["c","d"]], words = ["abcb"]
 <strong>输出：</strong>[]
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/37.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/37.exercises/solution.md"
index 074f84bb1..27df9b5af 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/37.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/37.exercises/solution.md"
@@ -17,7 +17,7 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/12/01/merged.jpg" style="width: 800px; height: 331px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/9e262d6191741087234d501132cd7cd7.jpeg" style="width: 800px; height: 331px;" />
 <pre>
 <strong>输入：</strong>buildings = [[2,9,10],[3,7,15],[5,12,12],[15,20,10],[19,24,8]]
 <strong>输出：</strong>[[2,10],[3,15],[7,12],[12,0],[15,10],[20,8],[24,0]]
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/4.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/4.exercises/solution.md"
index 3e02ac298..383fc81b2 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/4.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/4.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 柱状图中最大的矩形
 
-<p>给定 <em>n</em> 个非负整数，用来表示柱状图中各个柱子的高度。每个柱子彼此相邻，且宽度为 1 。</p><p>求在该柱状图中，能够勾勒出来的矩形的最大面积。</p><p>&nbsp;</p><p><img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0084.Largest%20Rectangle%20in%20Histogram/images/histogram.png"></p><p><small>以上是柱状图的示例，其中每个柱子的宽度为 1，给定的高度为&nbsp;<code>[2,1,5,6,2,3]</code>。</small></p><p>&nbsp;</p><p><img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0084.Largest%20Rectangle%20in%20Histogram/images/histogram_area.png"></p><p><small>图中阴影部分为所能勾勒出的最大矩形面积，其面积为&nbsp;<code>10</code>&nbsp;个单位。</small></p><p>&nbsp;</p><p><strong>示例:</strong></p><pre><strong>输入:</strong> [2,1,5,6,2,3]<strong><br />输出:</strong> 10</pre>
+<p>给定 <em>n</em> 个非负整数，用来表示柱状图中各个柱子的高度。每个柱子彼此相邻，且宽度为 1 。</p><p>求在该柱状图中，能够勾勒出来的矩形的最大面积。</p><p>&nbsp;</p><p><img src="https://img-service.csdnimg.cn/img_convert/947ba982417b598ee8de378ac4b1c2bf.png"></p><p><small>以上是柱状图的示例，其中每个柱子的宽度为 1，给定的高度为&nbsp;<code>[2,1,5,6,2,3]</code>。</small></p><p>&nbsp;</p><p><img src="https://img-service.csdnimg.cn/img_convert/2873fce06be97533e2bc5b5384510f67.png"></p><p><small>图中阴影部分为所能勾勒出的最大矩形面积，其面积为&nbsp;<code>10</code>&nbsp;个单位。</small></p><p>&nbsp;</p><p><strong>示例:</strong></p><pre><strong>输入:</strong> [2,1,5,6,2,3]<strong><br />输出:</strong> 10</pre>
 
 以下程序实现了这一功能，请你填补空白处内容：
 
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/44.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/44.exercises/solution.md"
index 63b322445..8d06e4065 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/44.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/44.exercises/solution.md"
@@ -9,7 +9,7 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2020/09/15/serdeser.jpg" style="width: 442px; height: 324px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/9387977615b7e602406be82d7d4452b9.jpeg" style="width: 442px; height: 324px;" />
 <pre>
 <strong>输入：</strong>root = [1,2,3,null,null,4,5]
 <strong>输出：</strong>[1,2,3,null,null,4,5]
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/50.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/50.exercises/solution.md"
index 253823f3d..97889faa7 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/50.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/50.exercises/solution.md"
@@ -7,14 +7,14 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/01/05/grid1.jpg" style="width: 242px; height: 242px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/d436ea72ef06c6038b50f729e3e23740.jpeg" style="width: 242px; height: 242px;" />
 <pre>
 <strong>输入：</strong>matrix = [[9,9,4],[6,6,8],[2,1,1]]
 <strong>输出：</strong>4 
 <strong>解释：</strong>最长递增路径为 <code>[1, 2, 6, 9]</code>。</pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/01/27/tmp-grid.jpg" style="width: 253px; height: 253px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/d467675b15c40a7cab7b64937f413672.jpeg" style="width: 253px; height: 253px;" />
 <pre>
 <strong>输入：</strong>matrix = [[3,4,5],[3,2,6],[2,2,1]]
 <strong>输出：</strong>4 
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/52.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/52.exercises/solution.md"
index 5aa71cb52..0f8572550 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/52.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/52.exercises/solution.md"
@@ -9,21 +9,21 @@
 <p>&nbsp;</p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/03/14/selfcross1-plane.jpg" style="width: 400px; height: 435px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/8ff63b9228149b90de12438778363e72.jpeg" style="width: 400px; height: 435px;" />
 <pre>
 <strong>输入：</strong>distance = [2,1,1,2]
 <strong>输出：</strong>true
 </pre>
 
 <p><strong>示例 2：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/03/14/selfcross2-plane.jpg" style="width: 400px; height: 435px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/61bb0e4736e54f12fc1585be35dc8b92.jpeg" style="width: 400px; height: 435px;" />
 <pre>
 <strong>输入：</strong>distance = [1,2,3,4]
 <strong>输出：</strong>false
 </pre>
 
 <p><strong>示例 3：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/03/14/selfcross3-plane.jpg" style="width: 400px; height: 435px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/bdefbc868dc738985c3e5a16ec3225f5.jpeg" style="width: 400px; height: 435px;" />
 <pre>
 <strong>输入：</strong>distance = [1,1,1,1]
 <strong>输出：</strong>true</pre>
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/56.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/56.exercises/solution.md"
index b774ec014..01de38e34 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/56.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/56.exercises/solution.md"
@@ -7,7 +7,7 @@
 <p> </p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/03/18/sum-grid.jpg" style="width: 255px; height: 176px;" />
+<img alt="" src="https://img-service.csdnimg.cn/img_convert/36c6ba4d37c75b0d1bc5cdf1a7801601.jpeg" style="width: 255px; height: 176px;" />
 <pre>
 <strong>输入：</strong>matrix = [[1,0,1],[0,-2,3]], k = 2
 <strong>输出：</strong>2
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/6.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/6.exercises/solution.md"
index 42047179f..981841c14 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/6.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/6.exercises/solution.md"
@@ -10,7 +10,7 @@
     <div class="original__bRMd">
         <div>
             <p><strong>示例 1：</strong></p>
-            <img style="width: 600px; height: 268px;" src="https://assets.leetcode.com/uploads/2020/11/13/queens.jpg"
+            <img style="width: 600px; height: 268px;" src="https://img-service.csdnimg.cn/img_convert/cc74a8b59b9a8fe64bb7a741774c2ad1.jpeg"
                 alt="">
             <pre><strong>输入：</strong>n = 4
 <strong>输出：</strong>2
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/7.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/7.exercises/solution.md"
index a761b338a..570bcc789 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/7.exercises/solution.md"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/7.exercises/solution.md"
@@ -1,6 +1,6 @@
 # 最大矩形
 
-<p>给定一个仅包含 <code>0</code> 和 <code>1</code> 、大小为 <code>rows x cols</code> 的二维二进制矩阵，找出只包含 <code>1</code> 的最大矩形，并返回其面积。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0085.Maximal%20Rectangle/images/maximal.jpg" style="width: 402px; height: 322px;" /><pre><strong>输入：</strong>matrix = [["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"],["1","0","0","1","0"]]<strong><br />输出：</strong>6<strong><br />解释：</strong>最大矩形如上图所示。</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>matrix = []<strong><br />输出：</strong>0</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>matrix = [["0"]]<strong><br />输出：</strong>0</pre><p><strong>示例 4：</strong></p><pre><strong>输入：</strong>matrix = [["1"]]<strong><br />输出：</strong>1</pre><p><strong>示例 5：</strong></p><pre><strong>输入：</strong>matrix = [["0","0"]]<strong><br />输出：</strong>0</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>rows == matrix.length</code></li>	<li><code>cols == matrix[0].length</code></li>	<li><code>0 <= row, cols <= 200</code></li>	<li><code>matrix[i][j]</code> 为 <code>'0'</code> 或 <code>'1'</code></li></ul>
+<p>给定一个仅包含 <code>0</code> 和 <code>1</code> 、大小为 <code>rows x cols</code> 的二维二进制矩阵，找出只包含 <code>1</code> 的最大矩形，并返回其面积。</p><p> </p><p><strong>示例 1：</strong></p><img alt="" src="https://img-service.csdnimg.cn/img_convert/52f17607758af8beae7a87191bff1795.jpeg" style="width: 402px; height: 322px;" /><pre><strong>输入：</strong>matrix = [["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"],["1","0","0","1","0"]]<strong><br />输出：</strong>6<strong><br />解释：</strong>最大矩形如上图所示。</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>matrix = []<strong><br />输出：</strong>0</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>matrix = [["0"]]<strong><br />输出：</strong>0</pre><p><strong>示例 4：</strong></p><pre><strong>输入：</strong>matrix = [["1"]]<strong><br />输出：</strong>1</pre><p><strong>示例 5：</strong></p><pre><strong>输入：</strong>matrix = [["0","0"]]<strong><br />输出：</strong>0</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>rows == matrix.length</code></li>	<li><code>cols == matrix[0].length</code></li>	<li><code>0 <= row, cols <= 200</code></li>	<li><code>matrix[i][j]</code> 为 <code>'0'</code> 或 <code>'1'</code></li></ul>
 
 以下程序实现了这一功能，请你填补空白处内容：
 
-- 
GitLab