doocs · yanglbme · Apr 29, 2022 · Apr 29, 2022
diff --git a/README_EN.md b/README_EN.md
@@ -14,7 +14,7 @@
 
 ## Introduction
 
-Complete solutions to [LeetCode](https://leetcode.com/problemset/all/), [LCOF](https://leetcode-cn.com/problemset/lcof/) and [LCCI](https://leetcode-cn.com/problemset/lcci/) problems, updated daily. Please give me a [star](https://github.com/doocs/leetcode) 🌟 if you like it.
+Complete solutions to [LeetCode](https://leetcode.com/problemset/all/), [LCOF](https://leetcode.cn/problemset/lcof/) and [LCCI](https://leetcode.cn/problemset/lcci/) problems, updated daily. Please give me a [star](https://github.com/doocs/leetcode) 🌟 if you like it.
 
 [中文文档](/README.md)
 

diff --git a/lcci/01.01.Is Unique/README.md b/lcci/01.01.Is Unique/README.md
@@ -1,4 +1,4 @@
-# [面试题 01.01. 判定字符是否唯一](https://leetcode-cn.com/problems/is-unique-lcci)
+# [面试题 01.01. 判定字符是否唯一](https://leetcode.cn/problems/is-unique-lcci)
 
 [English Version](/lcci/01.01.Is%20Unique/README_EN.md)
 

diff --git a/lcci/01.01.Is Unique/README_EN.md b/lcci/01.01.Is Unique/README_EN.md
@@ -1,4 +1,4 @@
-# [01.01. Is Unique](https://leetcode-cn.com/problems/is-unique-lcci)
+# [01.01. Is Unique](https://leetcode.cn/problems/is-unique-lcci)
 
 [中文文档](/lcci/01.01.Is%20Unique/README.md)
 

diff --git a/lcci/01.02.Check Permutation/README.md b/lcci/01.02.Check Permutation/README.md
@@ -1,4 +1,4 @@
-# [面试题 01.02. 判定是否互为字符重排](https://leetcode-cn.com/problems/check-permutation-lcci)
+# [面试题 01.02. 判定是否互为字符重排](https://leetcode.cn/problems/check-permutation-lcci)
 
 [English Version](/lcci/01.02.Check%20Permutation/README_EN.md)
 

diff --git a/lcci/01.02.Check Permutation/README_EN.md b/lcci/01.02.Check Permutation/README_EN.md
@@ -1,4 +1,4 @@
-# [01.02. Check Permutation](https://leetcode-cn.com/problems/check-permutation-lcci)
+# [01.02. Check Permutation](https://leetcode.cn/problems/check-permutation-lcci)
 
 [中文文档](/lcci/01.02.Check%20Permutation/README.md)
 

diff --git a/lcci/01.03.String to URL/README.md b/lcci/01.03.String to URL/README.md
@@ -1,4 +1,4 @@
-# [面试题 01.03. URL 化](https://leetcode-cn.com/problems/string-to-url-lcci)
+# [面试题 01.03. URL 化](https://leetcode.cn/problems/string-to-url-lcci)
 
 [English Version](/lcci/01.03.String%20to%20URL/README_EN.md)
 

diff --git a/lcci/01.03.String to URL/README_EN.md b/lcci/01.03.String to URL/README_EN.md
@@ -1,4 +1,4 @@
-# [01.03. String to URL](https://leetcode-cn.com/problems/string-to-url-lcci)
+# [01.03. String to URL](https://leetcode.cn/problems/string-to-url-lcci)
 
 [中文文档](/lcci/01.03.String%20to%20URL/README.md)
 

diff --git a/lcci/01.04.Palindrome Permutation/README.md b/lcci/01.04.Palindrome Permutation/README.md
@@ -1,4 +1,4 @@
-# [面试题 01.04. 回文排列](https://leetcode-cn.com/problems/palindrome-permutation-lcci)
+# [面试题 01.04. 回文排列](https://leetcode.cn/problems/palindrome-permutation-lcci)
 
 [English Version](/lcci/01.04.Palindrome%20Permutation/README_EN.md)
 

diff --git a/lcci/01.04.Palindrome Permutation/README_EN.md b/lcci/01.04.Palindrome Permutation/README_EN.md
@@ -1,4 +1,4 @@
-# [01.04. Palindrome Permutation](https://leetcode-cn.com/problems/palindrome-permutation-lcci)
+# [01.04. Palindrome Permutation](https://leetcode.cn/problems/palindrome-permutation-lcci)
 
 [中文文档](/lcci/01.04.Palindrome%20Permutation/README.md)
 

diff --git a/lcci/01.05.One Away/README.md b/lcci/01.05.One Away/README.md
@@ -1,4 +1,4 @@
-# [面试题 01.05. 一次编辑](https://leetcode-cn.com/problems/one-away-lcci)
+# [面试题 01.05. 一次编辑](https://leetcode.cn/problems/one-away-lcci)
 
 [English Version](/lcci/01.05.One%20Away/README_EN.md)
 
@@ -148,7 +148,7 @@ public:
 
 ### **Go**
 
-可以直接扩展成[编辑距离](https://leetcode-cn.com/problems/edit-distance/)问题的解法
+可以直接扩展成[编辑距离](https://leetcode.cn/problems/edit-distance/)问题的解法
 
 ```go
 func oneEditAway(first string, second string) bool {

diff --git a/lcci/01.05.One Away/README_EN.md b/lcci/01.05.One Away/README_EN.md
@@ -1,4 +1,4 @@
-# [01.05. One Away](https://leetcode-cn.com/problems/one-away-lcci)
+# [01.05. One Away](https://leetcode.cn/problems/one-away-lcci)
 
 [中文文档](/lcci/01.05.One%20Away/README.md)
 
@@ -132,7 +132,7 @@ public:
 
 ### **Go**
 
-Similar to [Edit Distance](https://leetcode-cn.com/problems/edit-distance/) solution
+Similar to [Edit Distance](https://leetcode.cn/problems/edit-distance/) solution
 
 ```go
 func oneEditAway(first string, second string) bool {

diff --git a/lcci/01.06.Compress String/README.md b/lcci/01.06.Compress String/README.md
@@ -1,4 +1,4 @@
-# [面试题 01.06. 字符串压缩](https://leetcode-cn.com/problems/compress-string-lcci)
+# [面试题 01.06. 字符串压缩](https://leetcode.cn/problems/compress-string-lcci)
 
 [English Version](/lcci/01.06.Compress%20String/README_EN.md)
 

diff --git a/lcci/01.06.Compress String/README_EN.md b/lcci/01.06.Compress String/README_EN.md
@@ -1,4 +1,4 @@
-# [01.06. Compress String](https://leetcode-cn.com/problems/compress-string-lcci)
+# [01.06. Compress String](https://leetcode.cn/problems/compress-string-lcci)
 
 [中文文档](/lcci/01.06.Compress%20String/README.md)
 

diff --git a/lcci/01.07.Rotate Matrix/README.md b/lcci/01.07.Rotate Matrix/README.md
@@ -1,4 +1,4 @@
-# [面试题 01.07. 旋转矩阵](https://leetcode-cn.com/problems/rotate-matrix-lcci)
+# [面试题 01.07. 旋转矩阵](https://leetcode.cn/problems/rotate-matrix-lcci)
 
 [English Version](/lcci/01.07.Rotate%20Matrix/README_EN.md)
 

diff --git a/lcci/01.07.Rotate Matrix/README_EN.md b/lcci/01.07.Rotate Matrix/README_EN.md
@@ -1,4 +1,4 @@
-# [01.07. Rotate Matrix](https://leetcode-cn.com/problems/rotate-matrix-lcci)
+# [01.07. Rotate Matrix](https://leetcode.cn/problems/rotate-matrix-lcci)
 
 [中文文档](/lcci/01.07.Rotate%20Matrix/README.md)
 

diff --git a/lcci/01.08.Zero Matrix/README.md b/lcci/01.08.Zero Matrix/README.md
@@ -1,4 +1,4 @@
-# [面试题 01.08. 零矩阵](https://leetcode-cn.com/problems/zero-matrix-lcci)
+# [面试题 01.08. 零矩阵](https://leetcode.cn/problems/zero-matrix-lcci)
 
 [English Version](/lcci/01.08.Zero%20Matrix/README_EN.md)
 

diff --git a/lcci/01.08.Zero Matrix/README_EN.md b/lcci/01.08.Zero Matrix/README_EN.md
@@ -1,4 +1,4 @@
-# [01.08. Zero Matrix](https://leetcode-cn.com/problems/zero-matrix-lcci)
+# [01.08. Zero Matrix](https://leetcode.cn/problems/zero-matrix-lcci)
 
 [中文文档](/lcci/01.08.Zero%20Matrix/README.md)
 

diff --git a/lcci/01.09.String Rotation/README.md b/lcci/01.09.String Rotation/README.md
@@ -1,4 +1,4 @@
-# [面试题 01.09. 字符串轮转](https://leetcode-cn.com/problems/string-rotation-lcci)
+# [面试题 01.09. 字符串轮转](https://leetcode.cn/problems/string-rotation-lcci)
 
 [English Version](/lcci/01.09.String%20Rotation/README_EN.md)
 

diff --git a/lcci/01.09.String Rotation/README_EN.md b/lcci/01.09.String Rotation/README_EN.md
@@ -1,4 +1,4 @@
-# [01.09. String Rotation](https://leetcode-cn.com/problems/string-rotation-lcci)
+# [01.09. String Rotation](https://leetcode.cn/problems/string-rotation-lcci)
 
 [中文文档](/lcci/01.09.String%20Rotation/README.md)
 

diff --git a/lcci/02.01.Remove Duplicate Node/README.md b/lcci/02.01.Remove Duplicate Node/README.md
@@ -1,4 +1,4 @@
-# [面试题 02.01. 移除重复节点](https://leetcode-cn.com/problems/remove-duplicate-node-lcci)
+# [面试题 02.01. 移除重复节点](https://leetcode.cn/problems/remove-duplicate-node-lcci)
 
 [English Version](/lcci/02.01.Remove%20Duplicate%20Node/README_EN.md)
 

diff --git a/lcci/02.01.Remove Duplicate Node/README_EN.md b/lcci/02.01.Remove Duplicate Node/README_EN.md
@@ -1,4 +1,4 @@
-# [02.01. Remove Duplicate Node](https://leetcode-cn.com/problems/remove-duplicate-node-lcci)
+# [02.01. Remove Duplicate Node](https://leetcode.cn/problems/remove-duplicate-node-lcci)
 
 [中文文档](/lcci/02.01.Remove%20Duplicate%20Node/README.md)
 

diff --git a/lcci/02.02.Kth Node From End of List/README.md b/lcci/02.02.Kth Node From End of List/README.md
@@ -1,4 +1,4 @@
-# [面试题 02.02. 返回倒数第 k 个节点](https://leetcode-cn.com/problems/kth-node-from-end-of-list-lcci)
+# [面试题 02.02. 返回倒数第 k 个节点](https://leetcode.cn/problems/kth-node-from-end-of-list-lcci)
 
 [English Version](/lcci/02.02.Kth%20Node%20From%20End%20of%20List/README_EN.md)
 

diff --git a/lcci/02.02.Kth Node From End of List/README_EN.md b/lcci/02.02.Kth Node From End of List/README_EN.md
@@ -1,4 +1,4 @@
-# [02.02. Kth Node From End of List](https://leetcode-cn.com/problems/kth-node-from-end-of-list-lcci)
+# [02.02. Kth Node From End of List](https://leetcode.cn/problems/kth-node-from-end-of-list-lcci)
 
 [中文文档](/lcci/02.02.Kth%20Node%20From%20End%20of%20List/README.md)
 

diff --git a/lcci/02.03.Delete Middle Node/README.md b/lcci/02.03.Delete Middle Node/README.md
@@ -1,4 +1,4 @@
-# [面试题 02.03. 删除中间节点](https://leetcode-cn.com/problems/delete-middle-node-lcci)
+# [面试题 02.03. 删除中间节点](https://leetcode.cn/problems/delete-middle-node-lcci)
 
 [English Version](/lcci/02.03.Delete%20Middle%20Node/README_EN.md)
 
@@ -27,7 +27,7 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
-> 此题与本站 [237. 删除链表中的节点](https://leetcode-cn.com/problems/delete-node-in-a-linked-list/) 题意相同。
+> 此题与本站 [237. 删除链表中的节点](https://leetcode.cn/problems/delete-node-in-a-linked-list/) 题意相同。
 
 步骤：
 

diff --git a/lcci/02.03.Delete Middle Node/README_EN.md b/lcci/02.03.Delete Middle Node/README_EN.md
@@ -1,4 +1,4 @@
-# [02.03. Delete Middle Node](https://leetcode-cn.com/problems/delete-middle-node-lcci)
+# [02.03. Delete Middle Node](https://leetcode.cn/problems/delete-middle-node-lcci)
 
 [中文文档](/lcci/02.03.Delete%20Middle%20Node/README.md)
 

diff --git a/lcci/02.04.Partition List/README.md b/lcci/02.04.Partition List/README.md
@@ -1,4 +1,4 @@
-# [面试题 02.04. 分割链表](https://leetcode-cn.com/problems/partition-list-lcci)
+# [面试题 02.04. 分割链表](https://leetcode.cn/problems/partition-list-lcci)
 
 [English Version](/lcci/02.04.Partition%20List/README_EN.md)
 

diff --git a/lcci/02.04.Partition List/README_EN.md b/lcci/02.04.Partition List/README_EN.md
@@ -1,4 +1,4 @@
-# [02.04. Partition List](https://leetcode-cn.com/problems/partition-list-lcci)
+# [02.04. Partition List](https://leetcode.cn/problems/partition-list-lcci)
 
 [中文文档](/lcci/02.04.Partition%20List/README.md)
 

diff --git a/lcci/02.05.Sum Lists/README.md b/lcci/02.05.Sum Lists/README.md
@@ -1,4 +1,4 @@
-# [面试题 02.05. 链表求和](https://leetcode-cn.com/problems/sum-lists-lcci)
+# [面试题 02.05. 链表求和](https://leetcode.cn/problems/sum-lists-lcci)
 
 [English Version](/lcci/02.05.Sum%20Lists/README_EN.md)
 

diff --git a/lcci/02.05.Sum Lists/README_EN.md b/lcci/02.05.Sum Lists/README_EN.md
@@ -1,4 +1,4 @@
-# [02.05. Sum Lists](https://leetcode-cn.com/problems/sum-lists-lcci)
+# [02.05. Sum Lists](https://leetcode.cn/problems/sum-lists-lcci)
 
 [中文文档](/lcci/02.05.Sum%20Lists/README.md)
 

diff --git a/lcci/02.06.Palindrome Linked List/README.md b/lcci/02.06.Palindrome Linked List/README.md
@@ -1,4 +1,4 @@
-# [面试题 02.06. 回文链表](https://leetcode-cn.com/problems/palindrome-linked-list-lcci)
+# [面试题 02.06. 回文链表](https://leetcode.cn/problems/palindrome-linked-list-lcci)
 
 [English Version](/lcci/02.06.Palindrome%20Linked%20List/README_EN.md)
 

diff --git a/lcci/02.06.Palindrome Linked List/README_EN.md b/lcci/02.06.Palindrome Linked List/README_EN.md
@@ -1,4 +1,4 @@
-# [02.06. Palindrome Linked List](https://leetcode-cn.com/problems/palindrome-linked-list-lcci)
+# [02.06. Palindrome Linked List](https://leetcode.cn/problems/palindrome-linked-list-lcci)
 
 [中文文档](/lcci/02.06.Palindrome%20Linked%20List/README.md)
 

diff --git a/lcci/02.07.Intersection of Two Linked Lists/README.md b/lcci/02.07.Intersection of Two Linked Lists/README.md
@@ -1,4 +1,4 @@
-# [面试题 02.07. 链表相交](https://leetcode-cn.com/problems/intersection-of-two-linked-lists-lcci)
+# [面试题 02.07. 链表相交](https://leetcode.cn/problems/intersection-of-two-linked-lists-lcci)
 
 [English Version](/lcci/02.07.Intersection%20of%20Two%20Linked%20Lists/README_EN.md)
 

diff --git a/lcci/02.07.Intersection of Two Linked Lists/README_EN.md b/lcci/02.07.Intersection of Two Linked Lists/README_EN.md
@@ -1,4 +1,4 @@
-# [02.07. Intersection of Two Linked Lists](https://leetcode-cn.com/problems/intersection-of-two-linked-lists-lcci)
+# [02.07. Intersection of Two Linked Lists](https://leetcode.cn/problems/intersection-of-two-linked-lists-lcci)
 
 [中文文档](/lcci/02.07.Intersection%20of%20Two%20Linked%20Lists/README.md)
 

diff --git a/lcci/02.08.Linked List Cycle/README.md b/lcci/02.08.Linked List Cycle/README.md
@@ -1,4 +1,4 @@
-# [面试题 02.08. 环路检测](https://leetcode-cn.com/problems/linked-list-cycle-lcci)
+# [面试题 02.08. 环路检测](https://leetcode.cn/problems/linked-list-cycle-lcci)
 
 [English Version](/lcci/02.08.Linked%20List%20Cycle/README_EN.md)
 

diff --git a/lcci/02.08.Linked List Cycle/README_EN.md b/lcci/02.08.Linked List Cycle/README_EN.md
@@ -1,4 +1,4 @@
-# [02.08. Linked List Cycle](https://leetcode-cn.com/problems/linked-list-cycle-lcci)
+# [02.08. Linked List Cycle](https://leetcode.cn/problems/linked-list-cycle-lcci)
 
 [中文文档](/lcci/02.08.Linked%20List%20Cycle/README.md)
 

diff --git a/lcci/03.01.Three in One/README.md b/lcci/03.01.Three in One/README.md
@@ -1,4 +1,4 @@
-# [面试题 03.01. 三合一](https://leetcode-cn.com/problems/three-in-one-lcci)
+# [面试题 03.01. 三合一](https://leetcode.cn/problems/three-in-one-lcci)
 
 [English Version](/lcci/03.01.Three%20in%20One/README_EN.md)
 

diff --git a/lcci/03.01.Three in One/README_EN.md b/lcci/03.01.Three in One/README_EN.md
@@ -1,4 +1,4 @@
-# [03.01. Three in One](https://leetcode-cn.com/problems/three-in-one-lcci)
+# [03.01. Three in One](https://leetcode.cn/problems/three-in-one-lcci)
 
 [中文文档](/lcci/03.01.Three%20in%20One/README.md)
 

diff --git a/lcci/03.02.Min Stack/README.md b/lcci/03.02.Min Stack/README.md
@@ -1,4 +1,4 @@
-# [面试题 03.02. 栈的最小值](https://leetcode-cn.com/problems/min-stack-lcci)
+# [面试题 03.02. 栈的最小值](https://leetcode.cn/problems/min-stack-lcci)
 
 [English Version](/lcci/03.02.Min%20Stack/README_EN.md)
 

diff --git a/lcci/03.02.Min Stack/README_EN.md b/lcci/03.02.Min Stack/README_EN.md
@@ -1,4 +1,4 @@
-# [03.02. Min Stack](https://leetcode-cn.com/problems/min-stack-lcci)
+# [03.02. Min Stack](https://leetcode.cn/problems/min-stack-lcci)
 
 [中文文档](/lcci/03.02.Min%20Stack/README.md)
 

diff --git a/lcci/03.03.Stack of Plates/README.md b/lcci/03.03.Stack of Plates/README.md
@@ -1,4 +1,4 @@
-# [面试题 03.03. 堆盘子](https://leetcode-cn.com/problems/stack-of-plates-lcci)
+# [面试题 03.03. 堆盘子](https://leetcode.cn/problems/stack-of-plates-lcci)
 
 [English Version](/lcci/03.03.Stack%20of%20Plates/README_EN.md)
 

diff --git a/lcci/03.03.Stack of Plates/README_EN.md b/lcci/03.03.Stack of Plates/README_EN.md
@@ -1,4 +1,4 @@
-# [03.03. Stack of Plates](https://leetcode-cn.com/problems/stack-of-plates-lcci)
+# [03.03. Stack of Plates](https://leetcode.cn/problems/stack-of-plates-lcci)
 
 [中文文档](/lcci/03.03.Stack%20of%20Plates/README.md)
 

diff --git a/lcci/03.04.Implement Queue using Stacks/README.md b/lcci/03.04.Implement Queue using Stacks/README.md
@@ -1,4 +1,4 @@
-# [面试题 03.04. 化栈为队](https://leetcode-cn.com/problems/implement-queue-using-stacks-lcci)
+# [面试题 03.04. 化栈为队](https://leetcode.cn/problems/implement-queue-using-stacks-lcci)
 
 [English Version](/lcci/03.04.Implement%20Queue%20using%20Stacks/README_EN.md)
 

diff --git a/lcci/03.04.Implement Queue using Stacks/README_EN.md b/lcci/03.04.Implement Queue using Stacks/README_EN.md
@@ -1,4 +1,4 @@
-# [03.04. Implement Queue using Stacks](https://leetcode-cn.com/problems/implement-queue-using-stacks-lcci)
+# [03.04. Implement Queue using Stacks](https://leetcode.cn/problems/implement-queue-using-stacks-lcci)
 
 [中文文档](/lcci/03.04.Implement%20Queue%20using%20Stacks/README.md)
 

diff --git a/lcci/03.05.Sort of Stacks/README.md b/lcci/03.05.Sort of Stacks/README.md
@@ -1,4 +1,4 @@
-# [面试题 03.05. 栈排序](https://leetcode-cn.com/problems/sort-of-stacks-lcci)
+# [面试题 03.05. 栈排序](https://leetcode.cn/problems/sort-of-stacks-lcci)
 
 [English Version](/lcci/03.05.Sort%20of%20Stacks/README_EN.md)
 

diff --git a/lcci/03.05.Sort of Stacks/README_EN.md b/lcci/03.05.Sort of Stacks/README_EN.md
@@ -1,4 +1,4 @@
-# [03.05. Sort of Stacks](https://leetcode-cn.com/problems/sort-of-stacks-lcci)
+# [03.05. Sort of Stacks](https://leetcode.cn/problems/sort-of-stacks-lcci)
 
 [中文文档](/lcci/03.05.Sort%20of%20Stacks/README.md)
 

diff --git a/lcci/03.06.Animal Shelter/README.md b/lcci/03.06.Animal Shelter/README.md
@@ -1,4 +1,4 @@
-# [面试题 03.06. 动物收容所](https://leetcode-cn.com/problems/animal-shelter-lcci)
+# [面试题 03.06. 动物收容所](https://leetcode.cn/problems/animal-shelter-lcci)
 
 [English Version](/lcci/03.06.Animal%20Shelter/README_EN.md)
 

diff --git a/lcci/03.06.Animal Shelter/README_EN.md b/lcci/03.06.Animal Shelter/README_EN.md
@@ -1,4 +1,4 @@
-# [03.06. Animal Shelter](https://leetcode-cn.com/problems/animal-shelter-lcci)
+# [03.06. Animal Shelter](https://leetcode.cn/problems/animal-shelter-lcci)
 
 [中文文档](/lcci/03.06.Animal%20Shelter/README.md)
 

diff --git a/lcci/04.01.Route Between Nodes/README.md b/lcci/04.01.Route Between Nodes/README.md
@@ -1,4 +1,4 @@
-# [面试题 04.01. 节点间通路](https://leetcode-cn.com/problems/route-between-nodes-lcci)
+# [面试题 04.01. 节点间通路](https://leetcode.cn/problems/route-between-nodes-lcci)
 
 [English Version](/lcci/04.01.Route%20Between%20Nodes/README_EN.md)
 

diff --git a/lcci/04.01.Route Between Nodes/README_EN.md b/lcci/04.01.Route Between Nodes/README_EN.md
@@ -1,4 +1,4 @@
-# [04.01. Route Between Nodes](https://leetcode-cn.com/problems/route-between-nodes-lcci)
+# [04.01. Route Between Nodes](https://leetcode.cn/problems/route-between-nodes-lcci)
 
 [中文文档](/lcci/04.01.Route%20Between%20Nodes/README.md)
 

diff --git a/lcci/04.02.Minimum Height Tree/README.md b/lcci/04.02.Minimum Height Tree/README.md
@@ -1,4 +1,4 @@
-# [面试题 04.02. 最小高度树](https://leetcode-cn.com/problems/minimum-height-tree-lcci)
+# [面试题 04.02. 最小高度树](https://leetcode.cn/problems/minimum-height-tree-lcci)
 
 [English Version](/lcci/04.02.Minimum%20Height%20Tree/README_EN.md)
 

diff --git a/lcci/04.02.Minimum Height Tree/README_EN.md b/lcci/04.02.Minimum Height Tree/README_EN.md
@@ -1,4 +1,4 @@
-# [04.02. Minimum Height Tree](https://leetcode-cn.com/problems/minimum-height-tree-lcci)
+# [04.02. Minimum Height Tree](https://leetcode.cn/problems/minimum-height-tree-lcci)
 
 [中文文档](/lcci/04.02.Minimum%20Height%20Tree/README.md)
 

diff --git a/lcci/04.03.List of Depth/README.md b/lcci/04.03.List of Depth/README.md
@@ -1,4 +1,4 @@
-# [面试题 04.03. 特定深度节点链表](https://leetcode-cn.com/problems/list-of-depth-lcci)
+# [面试题 04.03. 特定深度节点链表](https://leetcode.cn/problems/list-of-depth-lcci)
 
 [English Version](/lcci/04.03.List%20of%20Depth/README_EN.md)
 

diff --git a/lcci/04.03.List of Depth/README_EN.md b/lcci/04.03.List of Depth/README_EN.md
@@ -1,4 +1,4 @@
-# [04.03. List of Depth](https://leetcode-cn.com/problems/list-of-depth-lcci)
+# [04.03. List of Depth](https://leetcode.cn/problems/list-of-depth-lcci)
 
 [中文文档](/lcci/04.03.List%20of%20Depth/README.md)
 

diff --git a/lcci/04.04.Check Balance/README.md b/lcci/04.04.Check Balance/README.md
@@ -1,4 +1,4 @@
-# [面试题 04.04. 检查平衡性](https://leetcode-cn.com/problems/check-balance-lcci)
+# [面试题 04.04. 检查平衡性](https://leetcode.cn/problems/check-balance-lcci)
 
 [English Version](/lcci/04.04.Check%20Balance/README_EN.md)
 

diff --git a/lcci/04.04.Check Balance/README_EN.md b/lcci/04.04.Check Balance/README_EN.md
@@ -1,4 +1,4 @@
-# [04.04. Check Balance](https://leetcode-cn.com/problems/check-balance-lcci)
+# [04.04. Check Balance](https://leetcode.cn/problems/check-balance-lcci)
 
 [中文文档](/lcci/04.04.Check%20Balance/README.md)
 

diff --git a/lcci/04.05.Legal Binary Search Tree/README.md b/lcci/04.05.Legal Binary Search Tree/README.md
@@ -1,4 +1,4 @@
-# [面试题 04.05. 合法二叉搜索树](https://leetcode-cn.com/problems/legal-binary-search-tree-lcci)
+# [面试题 04.05. 合法二叉搜索树](https://leetcode.cn/problems/legal-binary-search-tree-lcci)
 
 [English Version](/lcci/04.05.Legal%20Binary%20Search%20Tree/README_EN.md)
 

diff --git a/lcci/04.05.Legal Binary Search Tree/README_EN.md b/lcci/04.05.Legal Binary Search Tree/README_EN.md
@@ -1,4 +1,4 @@
-# [04.05. Legal Binary Search Tree](https://leetcode-cn.com/problems/legal-binary-search-tree-lcci)
+# [04.05. Legal Binary Search Tree](https://leetcode.cn/problems/legal-binary-search-tree-lcci)
 
 [中文文档](/lcci/04.05.Legal%20Binary%20Search%20Tree/README.md)
 

diff --git a/lcci/04.06.Successor/README.md b/lcci/04.06.Successor/README.md
@@ -1,4 +1,4 @@
-# [面试题 04.06. 后继者](https://leetcode-cn.com/problems/successor-lcci)
+# [面试题 04.06. 后继者](https://leetcode.cn/problems/successor-lcci)
 
 [English Version](/lcci/04.06.Successor/README_EN.md)
 

diff --git a/lcci/04.06.Successor/README_EN.md b/lcci/04.06.Successor/README_EN.md
@@ -1,4 +1,4 @@
-# [04.06. Successor](https://leetcode-cn.com/problems/successor-lcci)
+# [04.06. Successor](https://leetcode.cn/problems/successor-lcci)
 
 [中文文档](/lcci/04.06.Successor/README.md)
 

diff --git a/lcci/04.08.First Common Ancestor/README.md b/lcci/04.08.First Common Ancestor/README.md
@@ -1,4 +1,4 @@
-# [面试题 04.08. 首个共同祖先](https://leetcode-cn.com/problems/first-common-ancestor-lcci)
+# [面试题 04.08. 首个共同祖先](https://leetcode.cn/problems/first-common-ancestor-lcci)
 
 [English Version](/lcci/04.08.First%20Common%20Ancestor/README_EN.md)
 

diff --git a/lcci/04.08.First Common Ancestor/README_EN.md b/lcci/04.08.First Common Ancestor/README_EN.md
@@ -1,4 +1,4 @@
-# [04.08. First Common Ancestor](https://leetcode-cn.com/problems/first-common-ancestor-lcci)
+# [04.08. First Common Ancestor](https://leetcode.cn/problems/first-common-ancestor-lcci)
 
 [中文文档](/lcci/04.08.First%20Common%20Ancestor/README.md)