update exercises

data/3.算法高阶/3.leetcode-图与搜索/2.133-克隆图/solution.md

@@ -25,7 +25,7 @@ class Node {
 
 <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 src="https://userblink.csdnimg.cn/20211118/qq_44193969/pic/434512b7eb8802e7512af498807cb598-0.png?x-oss-process=image/interlace,1/format,jpg/resize,w_375"></p>
 
 <pre><strong>输入：</strong>adjList = [[2,4],[1,3],[2,4],[1,3]]
 
@@ -43,7 +43,7 @@ class Node {
 
 <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 src="https://userblink.csdnimg.cn/20211118/qq_44193969/pic/65284a62c04d197acd304f80bc6c19e4-2.png?x-oss-process=image/interlace,1/format,jpg/resize,w_375"></p>
 
 <pre><strong>输入：</strong>adjList = [[]]
 
@@ -64,7 +64,7 @@ class Node {
 
 <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 src="https://userblink.csdnimg.cn/20211118/qq_44193969/pic/e45056991ce619cf0a6d3b6b1d6bf623-1.png?x-oss-process=image/interlace,1/format,jpg/resize,w_375"></p>
 
 <pre><strong>输入：</strong>adjList = [[2],[1]]