diff --git a/basic/basic-sort.md b/basic/basic-sort.md
index b442bec..001fa65 100644
--- a/basic/basic-sort.md
+++ b/basic/basic-sort.md
@@ -445,7 +445,7 @@ inline void radix_sort(unsigned A[], int len)
 
 ### 快排 partitiong
 
-> [!NOTE] **[LeetCode 215. 数组中的第K个最大元素](https://leetcode-cn.com/problems/kth-largest-element-in-an-array/)**
+> [!NOTE] **[LeetCode 215. 数组中的第K个最大元素](https://leetcode.cn/problems/kth-largest-element-in-an-array/)**
 > 
 > 题意: TODO
 
@@ -582,7 +582,7 @@ class Solution:
 
 ### 三路排序
 
-> [!NOTE] **[SwordOffer 21. 调整数组顺序使奇数位于偶数前面](https://leetcode-cn.com/problems/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof/)**
+> [!NOTE] **[SwordOffer 21. 调整数组顺序使奇数位于偶数前面](https://leetcode.cn/problems/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof/)**
 > 
 > 题意: TODO
 
@@ -641,7 +641,7 @@ class Solution(object):
 
 * * *
 
-> [!NOTE] **[LeetCode 75. 颜色分类](https://leetcode-cn.com/problems/sort-colors/)**
+> [!NOTE] **[LeetCode 75. 颜色分类](https://leetcode.cn/problems/sort-colors/)**
 > 
 > 题意: TODO
 
@@ -718,7 +718,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 324. 摆动排序 II](https://leetcode-cn.com/problems/wiggle-sort-ii/)**
+> [!NOTE] **[LeetCode 324. 摆动排序 II](https://leetcode.cn/problems/wiggle-sort-ii/)**
 > 
 > 题意: 非常 trick
 
@@ -988,7 +988,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 493. 翻转对](https://leetcode-cn.com/problems/reverse-pairs/)**
+> [!NOTE] **[LeetCode 493. 翻转对](https://leetcode.cn/problems/reverse-pairs/)**
 > 
 > 题意: TODO
 
@@ -1046,7 +1046,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1850. 邻位交换的最小次数](https://leetcode-cn.com/problems/minimum-adjacent-swaps-to-reach-the-kth-smallest-number/)** [TAG]
+> [!NOTE] **[LeetCode 1850. 邻位交换的最小次数](https://leetcode.cn/problems/minimum-adjacent-swaps-to-reach-the-kth-smallest-number/)** [TAG]
 > 
 > 题意: TODO
 
@@ -1104,7 +1104,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2193. 得到回文串的最少操作次数](https://leetcode-cn.com/problems/minimum-number-of-moves-to-make-palindrome/)** [TAG]
+> [!NOTE] **[LeetCode 2193. 得到回文串的最少操作次数](https://leetcode.cn/problems/minimum-number-of-moves-to-make-palindrome/)** [TAG]
 > 
 > 题意: TODO
 
@@ -1267,7 +1267,7 @@ public:
 
 ### 桶排序
 
-> [!NOTE] **[LeetCode 164. 最大间距](https://leetcode-cn.com/problems/maximum-gap/)**
+> [!NOTE] **[LeetCode 164. 最大间距](https://leetcode.cn/problems/maximum-gap/)**
 > 
 > 题意: TODO
 
diff --git a/basic/binary-lifting.md b/basic/binary-lifting.md
index b067927..8d1b107 100644
--- a/basic/binary-lifting.md
+++ b/basic/binary-lifting.md
@@ -136,7 +136,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1483. 树节点的第 K 个祖先](https://leetcode-cn.com/problems/kth-ancestor-of-a-tree-node/)**
+> [!NOTE] **[LeetCode 1483. 树节点的第 K 个祖先](https://leetcode.cn/problems/kth-ancestor-of-a-tree-node/)**
 > 
 > 题意: TODO
 
diff --git a/basic/binary.md b/basic/binary.md
index 93d1856..093e6be 100644
--- a/basic/binary.md
+++ b/basic/binary.md
@@ -429,7 +429,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 4. 寻找两个正序数组的中位数](https://leetcode-cn.com/problems/median-of-two-sorted-arrays/)**
+> [!NOTE] **[LeetCode 4. 寻找两个正序数组的中位数](https://leetcode.cn/problems/median-of-two-sorted-arrays/)**
 > 
 > 题意: TODO
 
@@ -525,7 +525,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 34. 在排序数组中查找元素的第一个和最后一个位置](https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array/)**
+> [!NOTE] **[LeetCode 34. 在排序数组中查找元素的第一个和最后一个位置](https://leetcode.cn/problems/find-first-and-last-position-of-element-in-sorted-array/)**
 > 
 > 题意: TODO
 
@@ -599,7 +599,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 162. 寻找峰值](https://leetcode-cn.com/problems/find-peak-element/)**
+> [!NOTE] **[LeetCode 162. 寻找峰值](https://leetcode.cn/problems/find-peak-element/)**
 > 
 > 题意: TODO
 
@@ -733,7 +733,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 274. H 指数](https://leetcode-cn.com/problems/h-index/)**
+> [!NOTE] **[LeetCode 274. H 指数](https://leetcode.cn/problems/h-index/)**
 > 
 > 题意: TODO
 
@@ -801,7 +801,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 275. H 指数 II](https://leetcode-cn.com/problems/h-index-ii/)**
+> [!NOTE] **[LeetCode 275. H 指数 II](https://leetcode.cn/problems/h-index-ii/)**
 > 
 > 题意: TODO
 
@@ -858,7 +858,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 540. 有序数组中的单一元素](https://leetcode-cn.com/problems/single-element-in-a-sorted-array/)**
+> [!NOTE] **[LeetCode 540. 有序数组中的单一元素](https://leetcode.cn/problems/single-element-in-a-sorted-array/)**
 > 
 > 题意: TODO
 
@@ -907,7 +907,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1818 绝对差值和](https://leetcode-cn.com/problems/minimum-absolute-sum-difference/)**
+> [!NOTE] **[LeetCode 1818 绝对差值和](https://leetcode.cn/problems/minimum-absolute-sum-difference/)**
 > 
 > 题意: TODO
 
@@ -966,7 +966,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2080. 区间内查询数字的频率](https://leetcode-cn.com/problems/range-frequency-queries/)**
+> [!NOTE] **[LeetCode 2080. 区间内查询数字的频率](https://leetcode.cn/problems/range-frequency-queries/)**
 > 
 > 题意: TODO
 
@@ -1070,7 +1070,7 @@ public:
 
 ### 二分答案
 
-> [!NOTE] **[LeetCode 410. 分割数组的最大值](https://leetcode-cn.com/problems/split-array-largest-sum/)**
+> [!NOTE] **[LeetCode 410. 分割数组的最大值](https://leetcode.cn/problems/split-array-largest-sum/)**
 > 
 > 题意: TODO
 
@@ -1192,7 +1192,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 475. 供暖器](https://leetcode-cn.com/problems/heaters/)**
+> [!NOTE] **[LeetCode 475. 供暖器](https://leetcode.cn/problems/heaters/)**
 > 
 > 题意: TODO
 
@@ -1260,7 +1260,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 778. 水位上升的泳池中游泳](https://leetcode-cn.com/problems/swim-in-rising-water/)**
+> [!NOTE] **[LeetCode 778. 水位上升的泳池中游泳](https://leetcode.cn/problems/swim-in-rising-water/)**
 > 
 > 题意: TODO
 
@@ -1326,7 +1326,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 793. 阶乘函数后 K 个零](https://leetcode-cn.com/problems/preimage-size-of-factorial-zeroes-function/)**
+> [!NOTE] **[LeetCode 793. 阶乘函数后 K 个零](https://leetcode.cn/problems/preimage-size-of-factorial-zeroes-function/)**
 > 
 > 题意: TODO
 
@@ -1386,7 +1386,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1292. 元素和小于等于阈值的正方形的最大边长](https://leetcode-cn.com/problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold/)**
+> [!NOTE] **[LeetCode 1292. 元素和小于等于阈值的正方形的最大边长](https://leetcode.cn/problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold/)**
 > 
 > 题意: TODO
 
@@ -1447,7 +1447,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1300. 转变数组后最接近目标值的数组和](https://leetcode-cn.com/problems/sum-of-mutated-array-closest-to-target/)**
+> [!NOTE] **[LeetCode 1300. 转变数组后最接近目标值的数组和](https://leetcode.cn/problems/sum-of-mutated-array-closest-to-target/)**
 > 
 > 题意: TODO
 
@@ -1515,7 +1515,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1552. 两球之间的磁力](https://leetcode-cn.com/problems/magnetic-force-between-two-balls/)**
+> [!NOTE] **[LeetCode 1552. 两球之间的磁力](https://leetcode.cn/problems/magnetic-force-between-two-balls/)**
 > 
 > 题意: TODO
 
@@ -1577,7 +1577,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1648. 销售价值减少的颜色球](https://leetcode-cn.com/problems/sell-diminishing-valued-colored-balls/)** [TAG]
+> [!NOTE] **[LeetCode 1648. 销售价值减少的颜色球](https://leetcode.cn/problems/sell-diminishing-valued-colored-balls/)** [TAG]
 > 
 > 题意: TODO
 
@@ -1696,7 +1696,7 @@ public:
 > 
 > 题意: 
 > 
-> 同 [LeetCode 1648. 销售价值减少的颜色球](https://leetcode-cn.com/problems/sell-diminishing-valued-colored-balls/) 稍作修改
+> 同 [LeetCode 1648. 销售价值减少的颜色球](https://leetcode.cn/problems/sell-diminishing-valued-colored-balls/) 稍作修改
 
 > [!TIP] **思路**
 > 
@@ -1814,7 +1814,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1870. 准时到达的列车最小时速](https://leetcode-cn.com/problems/minimum-speed-to-arrive-on-time/)**
+> [!NOTE] **[LeetCode 1870. 准时到达的列车最小时速](https://leetcode.cn/problems/minimum-speed-to-arrive-on-time/)**
 > 
 > 题意: TODO
 
@@ -2862,7 +2862,7 @@ public:
 
 ### 二分套二分
 
-> [!NOTE] **[LeetCode 2040. 两个有序数组的第 K 小乘积](https://leetcode-cn.com/problems/kth-smallest-product-of-two-sorted-arrays/)** [TAG]
+> [!NOTE] **[LeetCode 2040. 两个有序数组的第 K 小乘积](https://leetcode.cn/problems/kth-smallest-product-of-two-sorted-arrays/)** [TAG]
 > 
 > 题意: TODO
 
@@ -3077,7 +3077,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1515. 服务中心的最佳位置](https://leetcode-cn.com/problems/best-position-for-a-service-centre/)** [TAG]
+> [!NOTE] **[LeetCode 1515. 服务中心的最佳位置](https://leetcode.cn/problems/best-position-for-a-service-centre/)** [TAG]
 > 
 > 题意: POJ2420 原题
 
@@ -3154,7 +3154,7 @@ public:
 > 
 > `[l, r]` 而非 `[l, r)` 并且注意和右侧比较（such as `nums[mid] < nums[r]`）
 
-> [!NOTE] **[LeetCode 153. 寻找旋转排序数组中的最小值](https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array/)**
+> [!NOTE] **[LeetCode 153. 寻找旋转排序数组中的最小值](https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array/)**
 > 
 > 题意: TODO
 
@@ -3212,7 +3212,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 154. 寻找旋转排序数组中的最小值 II](https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array-ii/)**
+> [!NOTE] **[LeetCode 154. 寻找旋转排序数组中的最小值 II](https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array-ii/)**
 > 
 > 题意: TODO
 
@@ -3270,7 +3270,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 33. 搜索旋转排序数组](https://leetcode-cn.com/problems/search-in-rotated-sorted-array/)**
+> [!NOTE] **[LeetCode 33. 搜索旋转排序数组](https://leetcode.cn/problems/search-in-rotated-sorted-array/)**
 > 
 > 题意: TODO
 
@@ -3323,7 +3323,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 81. 搜索旋转排序数组 II](https://leetcode-cn.com/problems/search-in-rotated-sorted-array-ii/)**
+> [!NOTE] **[LeetCode 81. 搜索旋转排序数组 II](https://leetcode.cn/problems/search-in-rotated-sorted-array-ii/)**
 > 
 > 题意: TODO
 
@@ -3379,7 +3379,7 @@ public:
 
 ### 抽象二分思想
 
-> [!NOTE] **[LeetCode 74. 搜索二维矩阵](https://leetcode-cn.com/problems/search-a-2d-matrix/)**
+> [!NOTE] **[LeetCode 74. 搜索二维矩阵](https://leetcode.cn/problems/search-a-2d-matrix/)**
 > 
 > 题意: TODO
 
@@ -3451,7 +3451,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 240. 搜索二维矩阵 II](https://leetcode-cn.com/problems/search-a-2d-matrix-ii/)**
+> [!NOTE] **[LeetCode 240. 搜索二维矩阵 II](https://leetcode.cn/problems/search-a-2d-matrix-ii/)**
 > 
 > 题意: TODO
 
@@ -3507,7 +3507,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 378. 有序矩阵中第K小的元素](https://leetcode-cn.com/problems/kth-smallest-element-in-a-sorted-matrix/)**
+> [!NOTE] **[LeetCode 378. 有序矩阵中第K小的元素](https://leetcode.cn/problems/kth-smallest-element-in-a-sorted-matrix/)**
 > 
 > 题意: TODO
 
diff --git a/basic/construction.md b/basic/construction.md
index 5b96a7a..420feb4 100644
--- a/basic/construction.md
+++ b/basic/construction.md
@@ -110,7 +110,7 @@
 
 ### 待细分
 
-> [!NOTE] **[LeetCode 667. 优美的排列 II](https://leetcode-cn.com/problems/beautiful-arrangement-ii/)**
+> [!NOTE] **[LeetCode 667. 优美的排列 II](https://leetcode.cn/problems/beautiful-arrangement-ii/)**
 > 
 > 题意: TODO
 
@@ -158,7 +158,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1253. 重构 2 行二进制矩阵](https://leetcode-cn.com/problems/reconstruct-a-2-row-binary-matrix/)**
+> [!NOTE] **[LeetCode 1253. 重构 2 行二进制矩阵](https://leetcode.cn/problems/reconstruct-a-2-row-binary-matrix/)**
 > 
 > 题意: TODO
 
@@ -222,7 +222,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1968. 构造元素不等于两相邻元素平均值的数组](https://leetcode-cn.com/problems/array-with-elements-not-equal-to-average-of-neighbors/)**
+> [!NOTE] **[LeetCode 1968. 构造元素不等于两相邻元素平均值的数组](https://leetcode.cn/problems/array-with-elements-not-equal-to-average-of-neighbors/)**
 > 
 > 题意: TODO
 
@@ -1635,7 +1635,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2081. k 镜像数字的和](https://leetcode-cn.com/problems/sum-of-k-mirror-numbers/)** [TAG]
+> [!NOTE] **[LeetCode 2081. k 镜像数字的和](https://leetcode.cn/problems/sum-of-k-mirror-numbers/)** [TAG]
 > 
 > 题意: TODO
 
@@ -1711,7 +1711,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2217. 找到指定长度的回文数](https://leetcode-cn.com/problems/find-palindrome-with-fixed-length/)** [TAG]
+> [!NOTE] **[LeetCode 2217. 找到指定长度的回文数](https://leetcode.cn/problems/find-palindrome-with-fixed-length/)** [TAG]
 > 
 > 题意: TODO
 
diff --git a/basic/divide-and-conquer.md b/basic/divide-and-conquer.md
index 67693a2..806c5c2 100644
--- a/basic/divide-and-conquer.md
+++ b/basic/divide-and-conquer.md
@@ -235,7 +235,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 454. 四数相加 II](https://leetcode-cn.com/problems/4sum-ii/)**
+> [!NOTE] **[LeetCode 454. 四数相加 II](https://leetcode.cn/problems/4sum-ii/)**
 > 
 > 题意: TODO
 
@@ -293,7 +293,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 779. 第K个语法符号](https://leetcode-cn.com/problems/k-th-symbol-in-grammar/)**
+> [!NOTE] **[LeetCode 779. 第K个语法符号](https://leetcode.cn/problems/k-th-symbol-in-grammar/)**
 > 
 > 题意: TODO
 
@@ -334,7 +334,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1274. 矩形内船只的数目](https://leetcode-cn.com/problems/number-of-ships-in-a-rectangle/)** [TAG]
+> [!NOTE] **[LeetCode 1274. 矩形内船只的数目](https://leetcode.cn/problems/number-of-ships-in-a-rectangle/)** [TAG]
 > 
 > 题意: TODO
 
diff --git a/basic/greedy.md b/basic/greedy.md
index e8c3f94..1558182 100644
--- a/basic/greedy.md
+++ b/basic/greedy.md
@@ -122,7 +122,7 @@
 
 - [P1209\[USACO1.3\]修理牛棚 Barn Repair - 洛谷](https://www.luogu.com.cn/problem/P1209)
 - [P2123 皇后游戏 - 洛谷](https://www.luogu.com.cn/problem/P2123)
-- [LeetCode 上标签为算法的题目](https://leetcode-cn.com/tag/greedy/)
+- [LeetCode 上标签为算法的题目](https://leetcode.cn/tag/greedy/)
 
 ### 基本贪心
 
@@ -385,7 +385,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1363. 形成三的最大倍数](https://leetcode-cn.com/problems/largest-multiple-of-three/)**
+> [!NOTE] **[LeetCode 1363. 形成三的最大倍数](https://leetcode.cn/problems/largest-multiple-of-three/)**
 > 
 > 题意: 
 > 
@@ -483,7 +483,7 @@ public:
 
 > [!TIP] **思路**
 > 
-> 类似 **[LeetCode 1363. 形成三的最大倍数](https://leetcode-cn.com/problems/largest-multiple-of-three/)**
+> 类似 **[LeetCode 1363. 形成三的最大倍数](https://leetcode.cn/problems/largest-multiple-of-three/)**
 > 
 > 分情况讨论
 
@@ -591,7 +591,7 @@ int main() {
 * * *
 
 
-> [!NOTE] **[LeetCode 1402. 做菜顺序](https://leetcode-cn.com/problems/reducing-dishes/)**
+> [!NOTE] **[LeetCode 1402. 做菜顺序](https://leetcode.cn/problems/reducing-dishes/)**
 > 
 > 题意: 
 > 
@@ -641,7 +641,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1414. 和为 K 的最少斐波那契数字数目](https://leetcode-cn.com/problems/find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k/)**
+> [!NOTE] **[LeetCode 1414. 和为 K 的最少斐波那契数字数目](https://leetcode.cn/problems/find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k/)**
 > 
 > 题意: TODO
 
@@ -705,7 +705,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1536. 排布二进制网格的最少交换次数](https://leetcode-cn.com/problems/minimum-swaps-to-arrange-a-binary-grid/)** [TAG]
+> [!NOTE] **[LeetCode 1536. 排布二进制网格的最少交换次数](https://leetcode.cn/problems/minimum-swaps-to-arrange-a-binary-grid/)** [TAG]
 > 
 > 题意: TODO
 
@@ -768,7 +768,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1691. 堆叠长方体的最大高度](https://leetcode-cn.com/problems/maximum-height-by-stacking-cuboids/)**
+> [!NOTE] **[LeetCode 1691. 堆叠长方体的最大高度](https://leetcode.cn/problems/maximum-height-by-stacking-cuboids/)**
 > 
 > 题意: TODO
 
@@ -818,7 +818,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1717. 删除子字符串的最大得分](https://leetcode-cn.com/problems/maximum-score-from-removing-substrings/)** [TAG]
+> [!NOTE] **[LeetCode 1717. 删除子字符串的最大得分](https://leetcode.cn/problems/maximum-score-from-removing-substrings/)** [TAG]
 > 
 > 题意: TODO
 
@@ -886,7 +886,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2086. 从房屋收集雨水需要的最少水桶数](https://leetcode-cn.com/problems/minimum-number-of-buckets-required-to-collect-rainwater-from-houses/)**
+> [!NOTE] **[LeetCode 2086. 从房屋收集雨水需要的最少水桶数](https://leetcode.cn/problems/minimum-number-of-buckets-required-to-collect-rainwater-from-houses/)**
 > 
 > 题意: TODO
 
@@ -1913,7 +1913,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 462. 最少移动次数使数组元素相等 II](https://leetcode-cn.com/problems/minimum-moves-to-equal-array-elements-ii/)**
+> [!NOTE] **[LeetCode 462. 最少移动次数使数组元素相等 II](https://leetcode.cn/problems/minimum-moves-to-equal-array-elements-ii/)**
 > 
 > 题意: TODO
 
@@ -1978,7 +1978,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1703. 得到连续 K 个 1 的最少相邻交换次数](https://leetcode-cn.com/problems/minimum-adjacent-swaps-for-k-consecutive-ones/)** [TAG]
+> [!NOTE] **[LeetCode 1703. 得到连续 K 个 1 的最少相邻交换次数](https://leetcode.cn/problems/minimum-adjacent-swaps-for-k-consecutive-ones/)** [TAG]
 > 
 > 题意: TODO
 
@@ -2037,7 +2037,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2033. 获取单值网格的最小操作数](https://leetcode-cn.com/problems/minimum-operations-to-make-a-uni-value-grid/)**
+> [!NOTE] **[LeetCode 2033. 获取单值网格的最小操作数](https://leetcode.cn/problems/minimum-operations-to-make-a-uni-value-grid/)**
 > 
 > 题意: TODO
 
@@ -2164,7 +2164,7 @@ public:
 
 > [!TIP] **思路**
 > 
-> 同 [LeetCode 2033. 获取单值网格的最小操作数](https://leetcode-cn.com/problems/minimum-operations-to-make-a-uni-value-grid/)
+> 同 [LeetCode 2033. 获取单值网格的最小操作数](https://leetcode.cn/problems/minimum-operations-to-make-a-uni-value-grid/)
 > 
 > 很多博客并未提及为何可以使用中位数，直观来看使用中位数无法确保其他数可以有效转变为该中位数。
 > 
@@ -2339,7 +2339,7 @@ public:
 
 > [!NOTE] **[AcWing 803. 区间合并](https://www.acwing.com/problem/content/805/)**
 > 
-> 题意: [LeetCode 56. 合并区间](https://leetcode-cn.com/problems/merge-intervals/)
+> 题意: [LeetCode 56. 合并区间](https://leetcode.cn/problems/merge-intervals/)
 
 <details>
 <summary>详细代码</summary>
@@ -2422,7 +2422,7 @@ if __name__ == '__main__':
 
 * * *
 
-> [!NOTE] **[LeetCode 57. 插入区间](https://leetcode-cn.com/problems/insert-interval/)**
+> [!NOTE] **[LeetCode 57. 插入区间](https://leetcode.cn/problems/insert-interval/)**
 > 
 > 题意: TODO
 
@@ -2771,7 +2771,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 352. 将数据流变为多个不相交区间](https://leetcode-cn.com/problems/data-stream-as-disjoint-intervals/)**
+> [!NOTE] **[LeetCode 352. 将数据流变为多个不相交区间](https://leetcode.cn/problems/data-stream-as-disjoint-intervals/)**
 > 
 > 题意: TODO
 
@@ -2846,7 +2846,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 435. 无重叠区间](https://leetcode-cn.com/problems/non-overlapping-intervals/)**
+> [!NOTE] **[LeetCode 435. 无重叠区间](https://leetcode.cn/problems/non-overlapping-intervals/)**
 > 
 > 题意: TODO
 
@@ -2946,7 +2946,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 436. 寻找右区间](https://leetcode-cn.com/problems/find-right-interval/)**
+> [!NOTE] **[LeetCode 436. 寻找右区间](https://leetcode.cn/problems/find-right-interval/)**
 > 
 > 题意: TODO
 
@@ -3038,7 +3038,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 632. 最小区间](https://leetcode-cn.com/problems/smallest-range-covering-elements-from-k-lists/)**
+> [!NOTE] **[LeetCode 632. 最小区间](https://leetcode.cn/problems/smallest-range-covering-elements-from-k-lists/)**
 > 
 > 题意: TODO
 
@@ -3097,7 +3097,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 757. 设置交集大小至少为2](https://leetcode-cn.com/problems/set-intersection-size-at-least-two/)**
+> [!NOTE] **[LeetCode 757. 设置交集大小至少为2](https://leetcode.cn/problems/set-intersection-size-at-least-two/)**
 > 
 > 题意: TODO
 
@@ -3163,7 +3163,7 @@ public:
 >
 > 经典区间问题：每个区间内需要至少某些个点被覆盖，求满足所有区间的情况下的最小覆盖点数和
 > 
-> 相比 [LeetCode 757. 设置交集大小至少为2](https://leetcode-cn.com/problems/set-intersection-size-at-least-two/) 每个区间内要选的数量不一
+> 相比 [LeetCode 757. 设置交集大小至少为2](https://leetcode.cn/problems/set-intersection-size-at-least-two/) 每个区间内要选的数量不一
 >
 > TODO 进阶：[LCP 32. 批量处理任务](https://leetcode.cn/problems/t3fKg1/)
 > 
@@ -3231,7 +3231,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1229. 安排会议日程](https://leetcode-cn.com/problems/meeting-scheduler/)**
+> [!NOTE] **[LeetCode 1229. 安排会议日程](https://leetcode.cn/problems/meeting-scheduler/)**
 > 
 > 题意: TODO
 
@@ -3307,7 +3307,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1235. 规划兼职工作](https://leetcode-cn.com/problems/maximum-profit-in-job-scheduling/)**
+> [!NOTE] **[LeetCode 1235. 规划兼职工作](https://leetcode.cn/problems/maximum-profit-in-job-scheduling/)**
 > 
 > 题意: TODO
 
@@ -3385,13 +3385,13 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1751. 最多可以参加的会议数目 II](https://leetcode-cn.com/problems/maximum-number-of-events-that-can-be-attended-ii/)**
+> [!NOTE] **[LeetCode 1751. 最多可以参加的会议数目 II](https://leetcode.cn/problems/maximum-number-of-events-that-can-be-attended-ii/)**
 > 
 > 题意: TODO
 
 > [!TIP] **思路**
 > 
-> 与上题 [LeetCode 1235. 规划兼职工作](https://leetcode-cn.com/problems/maximum-profit-in-job-scheduling/) 一样
+> 与上题 [LeetCode 1235. 规划兼职工作](https://leetcode.cn/problems/maximum-profit-in-job-scheduling/) 一样
 > 
 > 但做法不同
 
@@ -3446,7 +3446,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1272. 删除区间](https://leetcode-cn.com/problems/remove-interval/)**
+> [!NOTE] **[LeetCode 1272. 删除区间](https://leetcode.cn/problems/remove-interval/)**
 > 
 > 题意: TODO
 
@@ -3500,7 +3500,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1546. 和为目标值的最大数目不重叠非空子数组数目](https://leetcode-cn.com/problems/maximum-number-of-non-overlapping-subarrays-with-sum-equals-target/)**
+> [!NOTE] **[LeetCode 1546. 和为目标值的最大数目不重叠非空子数组数目](https://leetcode.cn/problems/maximum-number-of-non-overlapping-subarrays-with-sum-equals-target/)**
 > 
 > 题意: TODO
 
@@ -3826,7 +3826,7 @@ if __name__ == '__main__':
 
 * * *
 
-> [!NOTE] **[LeetCode 2136. 全部开花的最早一天](https://leetcode-cn.com/problems/earliest-possible-day-of-full-bloom/)** [TAG]
+> [!NOTE] **[LeetCode 2136. 全部开花的最早一天](https://leetcode.cn/problems/earliest-possible-day-of-full-bloom/)** [TAG]
 > 
 > 题意: TODO
 
@@ -4066,7 +4066,7 @@ public:
 
 ### 贪心策略 堆维护
 
-> [!NOTE] **[LeetCode 407. 接雨水 II](https://leetcode-cn.com/problems/trapping-rain-water-ii/)**
+> [!NOTE] **[LeetCode 407. 接雨水 II](https://leetcode.cn/problems/trapping-rain-water-ii/)**
 > 
 > 题意: TODO
 
@@ -4190,7 +4190,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 502. IPO](https://leetcode-cn.com/problems/ipo/)**
+> [!NOTE] **[LeetCode 502. IPO](https://leetcode.cn/problems/ipo/)**
 > 
 > 题意: TODO
 
@@ -4246,7 +4246,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 630. 课程表 III](https://leetcode-cn.com/problems/course-schedule-iii/)**
+> [!NOTE] **[LeetCode 630. 课程表 III](https://leetcode.cn/problems/course-schedule-iii/)**
 > 
 > 题意: TODO
 
@@ -4297,7 +4297,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 659. 分割数组为连续子序列](https://leetcode-cn.com/problems/split-array-into-consecutive-subsequences/)**
+> [!NOTE] **[LeetCode 659. 分割数组为连续子序列](https://leetcode.cn/problems/split-array-into-consecutive-subsequences/)**
 > 
 > 题意: TODO
 
@@ -4376,7 +4376,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1353. 最多可以参加的会议数目](https://leetcode-cn.com/problems/maximum-number-of-events-that-can-be-attended/)** [TAG]
+> [!NOTE] **[LeetCode 1353. 最多可以参加的会议数目](https://leetcode.cn/problems/maximum-number-of-events-that-can-be-attended/)** [TAG]
 > 
 > 题意: TODO
 
@@ -4430,7 +4430,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1383. 最大的团队表现值](https://leetcode-cn.com/problems/maximum-performance-of-a-team/)**
+> [!NOTE] **[LeetCode 1383. 最大的团队表现值](https://leetcode.cn/problems/maximum-performance-of-a-team/)**
 > 
 > 题意: 
 > 
@@ -4493,7 +4493,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1488. 避免洪水泛滥](https://leetcode-cn.com/problems/avoid-flood-in-the-city/)**
+> [!NOTE] **[LeetCode 1488. 避免洪水泛滥](https://leetcode.cn/problems/avoid-flood-in-the-city/)**
 > 
 > 题意: TODO
 
@@ -4600,7 +4600,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1834. 单线程 CPU](https://leetcode-cn.com/problems/single-threaded-cpu/)** [TAG]
+> [!NOTE] **[LeetCode 1834. 单线程 CPU](https://leetcode.cn/problems/single-threaded-cpu/)** [TAG]
 > 
 > 题意: TODO
 
@@ -4796,7 +4796,7 @@ public:
 ### 贪心 堆 负数转正数思想 TODO
 
 
-> [!NOTE] **[LeetCode 1982. 从子集的和还原数组](https://leetcode-cn.com/problems/find-array-given-subset-sums/)** [TAG]
+> [!NOTE] **[LeetCode 1982. 从子集的和还原数组](https://leetcode.cn/problems/find-array-given-subset-sums/)** [TAG]
 > 
 > 题意: TODO
 
@@ -4806,13 +4806,13 @@ public:
 > 
 > 随后简化处理流程
 > 
-> > https://leetcode-cn.com/problems/find-array-given-subset-sums/solution/ti-jie-cong-zi-ji-de-he-huan-yuan-shu-zu-q9qw/
+> > https://leetcode.cn/problems/find-array-given-subset-sums/solution/ti-jie-cong-zi-ji-de-he-huan-yuan-shu-zu-q9qw/
 > > 
 > > 全非负数的基础版 题目链接 https://www.codechef.com/problems/ANUMLA
 > > 
 > > 理解思路
 > 
-> > https://leetcode-cn.com/problems/find-array-given-subset-sums/solution/jian-yi-ti-jie-by-sfiction-9i43/
+> > https://leetcode.cn/problems/find-array-given-subset-sums/solution/jian-yi-ti-jie-by-sfiction-9i43/
 > > 
 > > 本题有负值，则将所有数 -min_element 转化为非负问题
 > > 
@@ -5173,7 +5173,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 134. 加油站](https://leetcode-cn.com/problems/gas-station/)**
+> [!NOTE] **[LeetCode 134. 加油站](https://leetcode.cn/problems/gas-station/)**
 > 
 > 题意: TODO
 
@@ -5261,7 +5261,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 376. 摆动序列](https://leetcode-cn.com/problems/wiggle-subsequence/)**
+> [!NOTE] **[LeetCode 376. 摆动序列](https://leetcode.cn/problems/wiggle-subsequence/)**
 > 
 > 题意: TODO
 
@@ -5377,7 +5377,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1405. 最长快乐字符串](https://leetcode-cn.com/problems/longest-happy-string/)**
+> [!NOTE] **[LeetCode 1405. 最长快乐字符串](https://leetcode.cn/problems/longest-happy-string/)**
 > 
 > 题意: 
 > 
@@ -5462,7 +5462,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1520. 最多的不重叠子字符串](https://leetcode-cn.com/problems/maximum-number-of-non-overlapping-substrings/)** [TAG]
+> [!NOTE] **[LeetCode 1520. 最多的不重叠子字符串](https://leetcode.cn/problems/maximum-number-of-non-overlapping-substrings/)** [TAG]
 > 
 > 题意: 
 > 
@@ -5548,7 +5548,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1953. 你可以工作的最大周数](https://leetcode-cn.com/problems/maximum-number-of-weeks-for-which-you-can-work/)**
+> [!NOTE] **[LeetCode 1953. 你可以工作的最大周数](https://leetcode.cn/problems/maximum-number-of-weeks-for-which-you-can-work/)**
 > 
 > 题意: TODO
 
@@ -5620,7 +5620,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2071. 你可以安排的最多任务数目](https://leetcode-cn.com/problems/maximum-number-of-tasks-you-can-assign/)** TAG
+> [!NOTE] **[LeetCode 2071. 你可以安排的最多任务数目](https://leetcode.cn/problems/maximum-number-of-tasks-you-can-assign/)** TAG
 > 
 > 题意: TODO
 
@@ -5648,7 +5648,7 @@ public:
     vector<int> ts, ws;
     int q[N];
     
-    // https://leetcode-cn.com/problems/maximum-number-of-tasks-you-can-assign/solution/c-er-fen-tao-tan-xin-by-blackskygg-kmbu/
+    // https://leetcode.cn/problems/maximum-number-of-tasks-you-can-assign/solution/c-er-fen-tao-tan-xin-by-blackskygg-kmbu/
     bool check(int mid) {
         // 维护 [..., v + st] 的队列，当前worker的最优解一定是选择第一个or最后一个 或false
         int hh = 0, tt = -1, pills = ps;
@@ -5827,7 +5827,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2193. 得到回文串的最少操作次数](https://leetcode-cn.com/problems/minimum-number-of-moves-to-make-palindrome/)** [TAG]
+> [!NOTE] **[LeetCode 2193. 得到回文串的最少操作次数](https://leetcode.cn/problems/minimum-number-of-moves-to-make-palindrome/)** [TAG]
 > 
 > 题意: TODO
 
@@ -6541,7 +6541,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 2234. 花园的最大总美丽值](https://leetcode-cn.com/problems/maximum-total-beauty-of-the-gardens/)** [TAG]
+> [!NOTE] **[LeetCode 2234. 花园的最大总美丽值](https://leetcode.cn/problems/maximum-total-beauty-of-the-gardens/)** [TAG]
 > 
 > 题意: TODO
 
diff --git a/basic/prefix-sum.md b/basic/prefix-sum.md
index 705d104..bc373dc 100644
--- a/basic/prefix-sum.md
+++ b/basic/prefix-sum.md
@@ -263,7 +263,7 @@ $$
 
 ### 一般前缀和
 
-> [!NOTE] **[LeetCode 303. 区域和检索 - 数组不可变](https://leetcode-cn.com/problems/range-sum-query-immutable/)**
+> [!NOTE] **[LeetCode 303. 区域和检索 - 数组不可变](https://leetcode.cn/problems/range-sum-query-immutable/)**
 > 
 > 题意: TODO
 
@@ -331,7 +331,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 304. 二维区域和检索 - 矩阵不可变](https://leetcode-cn.com/problems/range-sum-query-2d-immutable/)**
+> [!NOTE] **[LeetCode 304. 二维区域和检索 - 矩阵不可变](https://leetcode.cn/problems/range-sum-query-2d-immutable/)**
 > 
 > 题意: TODO
 
@@ -384,7 +384,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 307. 区域和检索 - 数组可修改](https://leetcode-cn.com/problems/range-sum-query-mutable/)**
+> [!NOTE] **[LeetCode 307. 区域和检索 - 数组可修改](https://leetcode.cn/problems/range-sum-query-mutable/)**
 > 
 > 题意: TODO
 
@@ -477,7 +477,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 437. 路径总和 III](https://leetcode-cn.com/problems/path-sum-iii/)**
+> [!NOTE] **[LeetCode 437. 路径总和 III](https://leetcode.cn/problems/path-sum-iii/)**
 > 
 > 题意: TODO
 
@@ -796,7 +796,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 629. K个逆序对数组](https://leetcode-cn.com/problems/k-inverse-pairs-array/)**
+> [!NOTE] **[LeetCode 629. K个逆序对数组](https://leetcode.cn/problems/k-inverse-pairs-array/)**
 > 
 > 题意: TODO
 
@@ -847,7 +847,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1895. 最大的幻方](https://leetcode-cn.com/problems/largest-magic-square/)**
+> [!NOTE] **[LeetCode 1895. 最大的幻方](https://leetcode.cn/problems/largest-magic-square/)**
 > 
 > 题意: TODO
 
@@ -1048,7 +1048,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 363. 矩形区域不超过 K 的最大数值和](https://leetcode-cn.com/problems/max-sum-of-rectangle-no-larger-than-k/)**
+> [!NOTE] **[LeetCode 363. 矩形区域不超过 K 的最大数值和](https://leetcode.cn/problems/max-sum-of-rectangle-no-larger-than-k/)**
 > 
 > 题意: TODO
 
@@ -1165,7 +1165,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1139. 最大的以 1 为边界的正方形](https://leetcode-cn.com/problems/largest-1-bordered-square/)**
+> [!NOTE] **[LeetCode 1139. 最大的以 1 为边界的正方形](https://leetcode.cn/problems/largest-1-bordered-square/)**
 > 
 > 题意: TODO
 
@@ -1236,7 +1236,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1248. 统计「优美子数组」](https://leetcode-cn.com/problems/count-number-of-nice-subarrays/)**
+> [!NOTE] **[LeetCode 1248. 统计「优美子数组」](https://leetcode.cn/problems/count-number-of-nice-subarrays/)**
 > 
 > 题意: TODO
 
@@ -1280,7 +1280,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1658. 将 x 减到 0 的最小操作数](https://leetcode-cn.com/problems/minimum-operations-to-reduce-x-to-zero/)**
+> [!NOTE] **[LeetCode 1658. 将 x 减到 0 的最小操作数](https://leetcode.cn/problems/minimum-operations-to-reduce-x-to-zero/)**
 > 
 > 题意: TODO
 
@@ -1596,7 +1596,7 @@ public:
 
 ### 差分
 
-> [!NOTE] **[LeetCode 1674. 使数组互补的最少操作次数](https://leetcode-cn.com/problems/minimum-moves-to-make-array-complementary/)** [TAG]
+> [!NOTE] **[LeetCode 1674. 使数组互补的最少操作次数](https://leetcode.cn/problems/minimum-moves-to-make-array-complementary/)** [TAG]
 > 
 > 题意: TODO
 
@@ -1650,7 +1650,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2132. 用邮票贴满网格图](https://leetcode-cn.com/problems/stamping-the-grid/)** [TAG]
+> [!NOTE] **[LeetCode 2132. 用邮票贴满网格图](https://leetcode.cn/problems/stamping-the-grid/)** [TAG]
 > 
 > 题意: TODO
 
@@ -1850,7 +1850,7 @@ public:
 
 ### 差分思想 比如用map / 区间 / trick
 
-> [!NOTE] **[LeetCode 731. 我的日程安排表 II](https://leetcode-cn.com/problems/my-calendar-ii/)**
+> [!NOTE] **[LeetCode 731. 我的日程安排表 II](https://leetcode.cn/problems/my-calendar-ii/)**
 > 
 > 题意: TODO
 
@@ -1908,7 +1908,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 732. 我的日程安排表 III](https://leetcode-cn.com/problems/my-calendar-iii/)**
+> [!NOTE] **[LeetCode 732. 我的日程安排表 III](https://leetcode.cn/problems/my-calendar-iii/)**
 > 
 > 题意: TODO
 
@@ -1991,7 +1991,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 798. 得分最高的最小轮调](https://leetcode-cn.com/problems/smallest-rotation-with-highest-score/)**
+> [!NOTE] **[LeetCode 798. 得分最高的最小轮调](https://leetcode.cn/problems/smallest-rotation-with-highest-score/)**
 > 
 > 题意: TODO
 
diff --git a/basic/stl-sort.md b/basic/stl-sort.md
index d1a4694..787f10a 100644
--- a/basic/stl-sort.md
+++ b/basic/stl-sort.md
@@ -161,7 +161,7 @@ std::sort(da + 1, da + 1 + 10, cmp);  // 使用 cmp 函数进行比较，从大
 
 ## 习题
 
-> [!NOTE] **[LeetCode 1451. 重新排列句子中的单词](https://leetcode-cn.com/problems/rearrange-words-in-a-sentence/)**
+> [!NOTE] **[LeetCode 1451. 重新排列句子中的单词](https://leetcode.cn/problems/rearrange-words-in-a-sentence/)**
 > 
 > 题意: TODO
 
diff --git a/dp/basic.md b/dp/basic.md
index 9838978..28d49db 100644
--- a/dp/basic.md
+++ b/dp/basic.md
@@ -1000,7 +1000,7 @@ int main() {
 * * *
 
 
-> [!NOTE] **[LeetCode 174. 地下城游戏](https://leetcode-cn.com/problems/dungeon-game/)**
+> [!NOTE] **[LeetCode 174. 地下城游戏](https://leetcode.cn/problems/dungeon-game/)**
 > 
 > 题意: TODO
 
@@ -1132,7 +1132,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 221. 最大正方形](https://leetcode-cn.com/problems/maximal-square/)**
+> [!NOTE] **[LeetCode 221. 最大正方形](https://leetcode.cn/problems/maximal-square/)**
 > 
 > 题意: TODO
 
@@ -1199,13 +1199,13 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 2088. 统计农场中肥沃金字塔的数目](https://leetcode-cn.com/problems/count-fertile-pyramids-in-a-land/)**
+> [!NOTE] **[LeetCode 2088. 统计农场中肥沃金字塔的数目](https://leetcode.cn/problems/count-fertile-pyramids-in-a-land/)**
 > 
 > 题意: TODO
 
 > [!TIP] **思路**
 > 
-> [biweekly-66](https://leetcode-cn.com/contest/biweekly-contest-66/)
+> [biweekly-66](https://leetcode.cn/contest/biweekly-contest-66/)
 > 
 > 简单但经典
 > 
@@ -1313,7 +1313,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1277. 统计全为 1 的正方形子矩阵](https://leetcode-cn.com/problems/count-square-submatrices-with-all-ones/)**
+> [!NOTE] **[LeetCode 1277. 统计全为 1 的正方形子矩阵](https://leetcode.cn/problems/count-square-submatrices-with-all-ones/)**
 > 
 > 题意: TODO
 
@@ -1370,7 +1370,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 514. 自由之路](https://leetcode-cn.com/problems/freedom-trail/)**
+> [!NOTE] **[LeetCode 514. 自由之路](https://leetcode.cn/problems/freedom-trail/)**
 > 
 > 题意: TODO
 
@@ -1458,7 +1458,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 741. 摘樱桃](https://leetcode-cn.com/problems/cherry-pickup/)**
+> [!NOTE] **[LeetCode 741. 摘樱桃](https://leetcode.cn/problems/cherry-pickup/)**
 > 
 > 题意: TODO
 
@@ -1587,7 +1587,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1463. 摘樱桃 II](https://leetcode-cn.com/problems/cherry-pickup-ii/)**
+> [!NOTE] **[LeetCode 1463. 摘樱桃 II](https://leetcode.cn/problems/cherry-pickup-ii/)**
 > 
 > 题意: TODO
 
@@ -1709,7 +1709,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1301. 最大得分的路径数目](https://leetcode-cn.com/problems/number-of-paths-with-max-score/)**
+> [!NOTE] **[LeetCode 1301. 最大得分的路径数目](https://leetcode.cn/problems/number-of-paths-with-max-score/)**
 > 
 > 题意: TODO
 
@@ -1876,7 +1876,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1320. 二指输入的的最小距离](https://leetcode-cn.com/problems/minimum-distance-to-type-a-word-using-two-fingers/)** [TAG]
+> [!NOTE] **[LeetCode 1320. 二指输入的的最小距离](https://leetcode.cn/problems/minimum-distance-to-type-a-word-using-two-fingers/)** [TAG]
 > 
 > 题意: TODO
 
@@ -2434,7 +2434,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 300. 最长上升子序列](https://leetcode-cn.com/problems/longest-increasing-subsequence/)**
+> [!NOTE] **[LeetCode 300. 最长上升子序列](https://leetcode.cn/problems/longest-increasing-subsequence/)**
 > 
 > 题意: TODO
 
@@ -2594,7 +2594,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 354. 俄罗斯套娃信封问题](https://leetcode-cn.com/problems/russian-doll-envelopes/)**
+> [!NOTE] **[LeetCode 354. 俄罗斯套娃信封问题](https://leetcode.cn/problems/russian-doll-envelopes/)**
 > 
 > 题意: TODO
 
@@ -2733,7 +2733,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1626. 无矛盾的最佳球队](https://leetcode-cn.com/problems/best-team-with-no-conflicts/)**
+> [!NOTE] **[LeetCode 1626. 无矛盾的最佳球队](https://leetcode.cn/problems/best-team-with-no-conflicts/)**
 > 
 > 题意: TODO
 
@@ -2803,7 +2803,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1671. 得到山形数组的最少删除次数](https://leetcode-cn.com/problems/minimum-number-of-removals-to-make-mountain-array/)**
+> [!NOTE] **[LeetCode 1671. 得到山形数组的最少删除次数](https://leetcode.cn/problems/minimum-number-of-removals-to-make-mountain-array/)**
 > 
 > 题意: TODO
 
@@ -2896,7 +2896,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1840. 最高建筑高度](https://leetcode-cn.com/problems/maximum-building-height/)**
+> [!NOTE] **[LeetCode 1840. 最高建筑高度](https://leetcode.cn/problems/maximum-building-height/)**
 > 
 > 题意: TODO
 
@@ -3039,7 +3039,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1964. 找出到每个位置为止最长的有效障碍赛跑路线](https://leetcode-cn.com/problems/find-the-longest-valid-obstacle-course-at-each-position/)**
+> [!NOTE] **[LeetCode 1964. 找出到每个位置为止最长的有效障碍赛跑路线](https://leetcode.cn/problems/find-the-longest-valid-obstacle-course-at-each-position/)**
 > 
 > 题意: TODO
 
@@ -3155,7 +3155,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 2111 使数组 K 递增的最少操作次数](https://leetcode-cn.com/problems/minimum-operations-to-make-the-array-k-increasing/)**
+> [!NOTE] **[LeetCode 2111 使数组 K 递增的最少操作次数](https://leetcode.cn/problems/minimum-operations-to-make-the-array-k-increasing/)**
 > 
 > 题意: TODO
 
@@ -3479,7 +3479,7 @@ int main() {
 
 ### 类 LIS 思想
 
-> [!NOTE] **[LeetCode 368. 最大整除子集](https://leetcode-cn.com/problems/largest-divisible-subset/)**
+> [!NOTE] **[LeetCode 368. 最大整除子集](https://leetcode.cn/problems/largest-divisible-subset/)**
 > 
 > 题意: TODO
 
@@ -3614,7 +3614,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1218. 最长定差子序列](https://leetcode-cn.com/problems/longest-arithmetic-subsequence-of-given-difference/)**
+> [!NOTE] **[LeetCode 1218. 最长定差子序列](https://leetcode.cn/problems/longest-arithmetic-subsequence-of-given-difference/)**
 > 
 > 题意: TODO
 
@@ -3819,7 +3819,7 @@ int main() {
 
 ### LIS 与 LCS
 
-> [!NOTE] **[LeetCode 1713. 得到子序列的最少操作次数](https://leetcode-cn.com/problems/minimum-operations-to-make-a-subsequence/)**
+> [!NOTE] **[LeetCode 1713. 得到子序列的最少操作次数](https://leetcode.cn/problems/minimum-operations-to-make-a-subsequence/)**
 > 
 > [Weekly-222](https://github.com/OpenKikCoc/LeetCode/tree/master/Contest/2021-01-03_Weekly-222)
 > 
@@ -4042,7 +4042,7 @@ if __name__=='__main__':
 
 * * *
 
-> [!NOTE] **[LeetCode 583. 两个字符串的删除操作](https://leetcode-cn.com/problems/delete-operation-for-two-strings/)**
+> [!NOTE] **[LeetCode 583. 两个字符串的删除操作](https://leetcode.cn/problems/delete-operation-for-two-strings/)**
 > 
 > 题意: TODO
 
@@ -4578,7 +4578,7 @@ if __name__ == '__main__':
 
 * * *
 
-> [!NOTE] **[LeetCode 1955. 统计特殊子序列的数目](https://leetcode-cn.com/problems/count-number-of-special-subsequences/)**
+> [!NOTE] **[LeetCode 1955. 统计特殊子序列的数目](https://leetcode.cn/problems/count-number-of-special-subsequences/)**
 > 
 > [weekly-252](https://github.com/OpenKikCoc/LeetCode/tree/master/Contest/2021-08-01_Weekly-252)
 > 
@@ -5069,7 +5069,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 551. 学生出勤记录 I](https://leetcode-cn.com/problems/student-attendance-record-i/)**
+> [!NOTE] **[LeetCode 551. 学生出勤记录 I](https://leetcode.cn/problems/student-attendance-record-i/)**
 > 
 > 题意: TODO
 
@@ -5126,7 +5126,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 552. 学生出勤记录 II](https://leetcode-cn.com/problems/student-attendance-record-ii/)**
+> [!NOTE] **[LeetCode 552. 学生出勤记录 II](https://leetcode.cn/problems/student-attendance-record-ii/)**
 > 
 > 题意: TODO
 
@@ -5307,7 +5307,7 @@ public:
 
 ### trick
 
-> [!NOTE] **[LeetCode 576. 出界的路径数](https://leetcode-cn.com/problems/out-of-boundary-paths/)**
+> [!NOTE] **[LeetCode 576. 出界的路径数](https://leetcode.cn/problems/out-of-boundary-paths/)**
 > 
 > 题意: TODO
 
@@ -5490,7 +5490,7 @@ class Solution:
 
 #### 类似编辑距离的进阶
 
-> [!NOTE] **[LeetCode 2060. 同源字符串检测](https://leetcode-cn.com/problems/check-if-an-original-string-exists-given-two-encoded-strings/)** TAG
+> [!NOTE] **[LeetCode 2060. 同源字符串检测](https://leetcode.cn/problems/check-if-an-original-string-exists-given-two-encoded-strings/)** TAG
 > 
 > 题意: TODO
 
diff --git a/dp/count.md b/dp/count.md
index 6e4e711..21860e5 100644
--- a/dp/count.md
+++ b/dp/count.md
@@ -152,7 +152,7 @@ if __name__ == '__main__':
 
 * * *
 
-> [!NOTE] **[LeetCode 440. 字典序的第K小数字](https://leetcode-cn.com/problems/k-th-smallest-in-lexicographical-order/)**
+> [!NOTE] **[LeetCode 440. 字典序的第K小数字](https://leetcode.cn/problems/k-th-smallest-in-lexicographical-order/)**
 > 
 > 题意: TODO
 
@@ -263,7 +263,7 @@ public:
 
 ### 可重集排列问题
 
-> [!NOTE] **[LeetCode 1916. 统计为蚁群构筑房间的不同顺序](https://leetcode-cn.com/problems/count-ways-to-build-rooms-in-an-ant-colony/)** [TAG]
+> [!NOTE] **[LeetCode 1916. 统计为蚁群构筑房间的不同顺序](https://leetcode.cn/problems/count-ways-to-build-rooms-in-an-ant-colony/)** [TAG]
 > 
 > 题意: TODO
 
diff --git a/dp/dag.md b/dp/dag.md
index 843cfdd..2438486 100644
--- a/dp/dag.md
+++ b/dp/dag.md
@@ -199,7 +199,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 2192. 有向无环图中一个节点的所有祖先](https://leetcode-cn.com/problems/all-ancestors-of-a-node-in-a-directed-acyclic-graph/)**
+> [!NOTE] **[LeetCode 2192. 有向无环图中一个节点的所有祖先](https://leetcode.cn/problems/all-ancestors-of-a-node-in-a-directed-acyclic-graph/)**
 > 
 > 题意: TODO
 
diff --git a/dp/definition.md b/dp/definition.md
index f9179ab..bb75fab 100644
--- a/dp/definition.md
+++ b/dp/definition.md
@@ -551,7 +551,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 494. 目标和](https://leetcode-cn.com/problems/target-sum/)**
+> [!NOTE] **[LeetCode 494. 目标和](https://leetcode.cn/problems/target-sum/)**
 > 
 > 题意: TODO
 
@@ -1055,7 +1055,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1866. 恰有 K 根木棍可以看到的排列数目](https://leetcode-cn.com/problems/number-of-ways-to-rearrange-sticks-with-k-sticks-visible/)** [TAG]
+> [!NOTE] **[LeetCode 1866. 恰有 K 根木棍可以看到的排列数目](https://leetcode.cn/problems/number-of-ways-to-rearrange-sticks-with-k-sticks-visible/)** [TAG]
 > 
 > 题意: TODO
 
diff --git a/dp/interval.md b/dp/interval.md
index ee7d888..bd91c5c 100644
--- a/dp/interval.md
+++ b/dp/interval.md
@@ -642,7 +642,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 87. 扰乱字符串](https://leetcode-cn.com/problems/scramble-string/)**
+> [!NOTE] **[LeetCode 87. 扰乱字符串](https://leetcode.cn/problems/scramble-string/)**
 > 
 > 题意: TODO
 
@@ -822,7 +822,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 97. 交错字符串](https://leetcode-cn.com/problems/interleaving-string/)**
+> [!NOTE] **[LeetCode 97. 交错字符串](https://leetcode.cn/problems/interleaving-string/)**
 > 
 > 题意: TODO
 
@@ -923,7 +923,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 312. 戳气球](https://leetcode-cn.com/problems/burst-balloons/)**
+> [!NOTE] **[LeetCode 312. 戳气球](https://leetcode.cn/problems/burst-balloons/)**
 > 
 > 题意: TODO
 
@@ -1011,7 +1011,7 @@ class Solution(object):
 
 * * *
 
-> [!NOTE] **[LeetCode 375. 猜数字大小 II](https://leetcode-cn.com/problems/guess-number-higher-or-lower-ii/)**
+> [!NOTE] **[LeetCode 375. 猜数字大小 II](https://leetcode.cn/problems/guess-number-higher-or-lower-ii/)**
 > 
 > 题意: TODO
 
@@ -1095,7 +1095,7 @@ class Solution(object):
 
 * * *
 
-> [!NOTE] **[LeetCode 486. 预测赢家](https://leetcode-cn.com/problems/predict-the-winner/)**
+> [!NOTE] **[LeetCode 486. 预测赢家](https://leetcode.cn/problems/predict-the-winner/)**
 > 
 > 题意: TODO
 
@@ -1170,7 +1170,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 664. 奇怪的打印机](https://leetcode-cn.com/problems/strange-printer/)**
+> [!NOTE] **[LeetCode 664. 奇怪的打印机](https://leetcode.cn/problems/strange-printer/)**
 > 
 > 题意: TODO
 
@@ -1267,7 +1267,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 730. 统计不同回文子序列](https://leetcode-cn.com/problems/count-different-palindromic-subsequences/)**
+> [!NOTE] **[LeetCode 730. 统计不同回文子序列](https://leetcode.cn/problems/count-different-palindromic-subsequences/)**
 > 
 > 题意: TODO
 
@@ -1405,7 +1405,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1246. 删除回文子数组](https://leetcode-cn.com/problems/palindrome-removal/)**
+> [!NOTE] **[LeetCode 1246. 删除回文子数组](https://leetcode.cn/problems/palindrome-removal/)**
 > 
 > 题意: TODO
 
@@ -1478,13 +1478,13 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1531. 压缩字符串 II](https://leetcode-cn.com/problems/string-compression-ii/)** [TAG]
+> [!NOTE] **[LeetCode 1531. 压缩字符串 II](https://leetcode.cn/problems/string-compression-ii/)** [TAG]
 > 
 > 题意: TODO
 
 > [!TIP] **思路**
 > 
-> dp 解释参考 [题解](https://leetcode-cn.com/problems/string-compression-ii/solution/zhuan-zai-dp-by-mike-meng/)
+> dp 解释参考 [题解](https://leetcode.cn/problems/string-compression-ii/solution/zhuan-zai-dp-by-mike-meng/)
 > 
 > 状态定义 十分十分 trick 的状态转移与推理 ==> `前 i 个字符中最多选择 j 个字符进行删除`
 > 
@@ -1541,7 +1541,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1770. 执行乘法运算的最大分数](https://leetcode-cn.com/problems/maximum-score-from-performing-multiplication-operations/)**
+> [!NOTE] **[LeetCode 1770. 执行乘法运算的最大分数](https://leetcode.cn/problems/maximum-score-from-performing-multiplication-operations/)**
 > 
 > 题意: TODO
 
@@ -1784,7 +1784,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1444. 切披萨的方案数](https://leetcode-cn.com/problems/number-of-ways-of-cutting-a-pizza/)**
+> [!NOTE] **[LeetCode 1444. 切披萨的方案数](https://leetcode.cn/problems/number-of-ways-of-cutting-a-pizza/)**
 > 
 > 题意: 
 > 
@@ -1850,7 +1850,7 @@ public:
 
 ### 进阶
 
-> [!NOTE] **[LeetCode 2019. 解出数学表达式的学生分数](https://leetcode-cn.com/problems/the-score-of-students-solving-math-expression/)**
+> [!NOTE] **[LeetCode 2019. 解出数学表达式的学生分数](https://leetcode.cn/problems/the-score-of-students-solving-math-expression/)**
 > 
 > [weekly-260](https://github.com/OpenKikCoc/LeetCode/tree/master/Contest/2021-09-26_Weekly-260)
 > 
@@ -2050,7 +2050,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1771. 由子序列构造的最长回文串的长度](https://leetcode-cn.com/problems/maximize-palindrome-length-from-subsequences/)** [TAG]
+> [!NOTE] **[LeetCode 1771. 由子序列构造的最长回文串的长度](https://leetcode.cn/problems/maximize-palindrome-length-from-subsequences/)** [TAG]
 > 
 > 题意: TODO
 
@@ -2345,7 +2345,7 @@ public:
 
 尤其是线性优化
 
-> [!NOTE] **[LeetCode 1937. 扣分后的最大得分](https://leetcode-cn.com/problems/maximum-number-of-points-with-cost/)**
+> [!NOTE] **[LeetCode 1937. 扣分后的最大得分](https://leetcode.cn/problems/maximum-number-of-points-with-cost/)**
 > 
 > [weekly-250](https://github.com/OpenKikCoc/LeetCode/tree/master/Contest/2021-07-18_Weekly-250)
 > 
@@ -2418,7 +2418,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1977. 划分数字的方案数](https://leetcode-cn.com/problems/number-of-ways-to-separate-numbers/)**
+> [!NOTE] **[LeetCode 1977. 划分数字的方案数](https://leetcode.cn/problems/number-of-ways-to-separate-numbers/)**
 > 
 > [biweekly-59](https://github.com/OpenKikCoc/LeetCode/tree/master/Contest/2021-08-21_Biweekly-59)
 > 
@@ -2523,7 +2523,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 546. 移除盒子](https://leetcode-cn.com/problems/remove-boxes/)**
+> [!NOTE] **[LeetCode 546. 移除盒子](https://leetcode.cn/problems/remove-boxes/)**
 > 
 > 题意: TODO
 
@@ -2690,7 +2690,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1563. 石子游戏 V](https://leetcode-cn.com/problems/stone-game-v/)** [TAG]
+> [!NOTE] **[LeetCode 1563. 石子游戏 V](https://leetcode.cn/problems/stone-game-v/)** [TAG]
 > 
 > 题意: TODO
 
@@ -2702,7 +2702,7 @@ public:
 > 
 > - 区间DP基础上 + 记忆化 ==> AC
 > 
-> - 优化写法: [考虑不用记忆化搜索的优化](https://leetcode-cn.com/problems/stone-game-v/solution/on2dong-tai-gui-hua-jie-fa-by-huangyuyang/) ==> AC
+> - 优化写法: [考虑不用记忆化搜索的优化](https://leetcode.cn/problems/stone-game-v/solution/on2dong-tai-gui-hua-jie-fa-by-huangyuyang/) ==> AC
 > 
 > **非常经典的优化（题目条件每个数都是正数 且本题特殊条件说明左右区间比大小 显然可以预处理）**
 > 
diff --git a/dp/knapsack.md b/dp/knapsack.md
index 2048817..633f1ee 100644
--- a/dp/knapsack.md
+++ b/dp/knapsack.md
@@ -1936,7 +1936,7 @@ Actually, this is a 0/1 knapsack problem.
 
 * * *
 
-> [!NOTE] **[LeetCode 1449. 数位成本和为目标值的最大数字](https://leetcode-cn.com/problems/form-largest-integer-with-digits-that-add-up-to-target/)**
+> [!NOTE] **[LeetCode 1449. 数位成本和为目标值的最大数字](https://leetcode.cn/problems/form-largest-integer-with-digits-that-add-up-to-target/)**
 > 
 > 题意: 
 > 
@@ -2293,7 +2293,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 474. 一和零](https://leetcode-cn.com/problems/ones-and-zeroes/)**
+> [!NOTE] **[LeetCode 474. 一和零](https://leetcode.cn/problems/ones-and-zeroes/)**
 > 
 > 题意: TODO
 
@@ -2830,7 +2830,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1155. 掷骰子的N种方法](https://leetcode-cn.com/problems/number-of-dice-rolls-with-target-sum/)** TAG
+> [!NOTE] **[LeetCode 1155. 掷骰子的N种方法](https://leetcode.cn/problems/number-of-dice-rolls-with-target-sum/)** TAG
 > 
 > 题意: TODO
 
diff --git a/dp/line.md b/dp/line.md
index a92170a..b2a5ad4 100644
--- a/dp/line.md
+++ b/dp/line.md
@@ -59,7 +59,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 32. 最长有效括号](https://leetcode-cn.com/problems/longest-valid-parentheses/)**
+> [!NOTE] **[LeetCode 32. 最长有效括号](https://leetcode.cn/problems/longest-valid-parentheses/)**
 > 
 > 题意: TODO
 
@@ -165,7 +165,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 115. 不同的子序列](https://leetcode-cn.com/problems/distinct-subsequences/)**
+> [!NOTE] **[LeetCode 115. 不同的子序列](https://leetcode.cn/problems/distinct-subsequences/)**
 > 
 > 题意: TODO
 
@@ -243,7 +243,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 152. 乘积最大子数组](https://leetcode-cn.com/problems/maximum-product-subarray/)**
+> [!NOTE] **[LeetCode 152. 乘积最大子数组](https://leetcode.cn/problems/maximum-product-subarray/)**
 > 
 > 题意: TODO
 
@@ -332,7 +332,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 413. 等差数列划分](https://leetcode-cn.com/problems/arithmetic-slices/)**
+> [!NOTE] **[LeetCode 413. 等差数列划分](https://leetcode.cn/problems/arithmetic-slices/)**
 > 
 > 题意: TODO
 
@@ -457,7 +457,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 446. 等差数列划分 II - 子序列](https://leetcode-cn.com/problems/arithmetic-slices-ii-subsequence/)**
+> [!NOTE] **[LeetCode 446. 等差数列划分 II - 子序列](https://leetcode.cn/problems/arithmetic-slices-ii-subsequence/)**
 > 
 > 题意: TODO
 
@@ -524,7 +524,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 639. 解码方法II](https://leetcode-cn.com/problems/decode-ways-ii/)**
+> [!NOTE] **[LeetCode 639. 解码方法II](https://leetcode.cn/problems/decode-ways-ii/)**
 > 
 > 题意: TODO
 
@@ -580,7 +580,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 688. “马”在棋盘上的概率](https://leetcode-cn.com/problems/knight-probability-in-chessboard/)**
+> [!NOTE] **[LeetCode 688. “马”在棋盘上的概率](https://leetcode.cn/problems/knight-probability-in-chessboard/)**
 > 
 > 题意: TODO
 
@@ -673,7 +673,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 790. 多米诺和托米诺平铺](https://leetcode-cn.com/problems/domino-and-tromino-tiling/)**
+> [!NOTE] **[LeetCode 790. 多米诺和托米诺平铺](https://leetcode.cn/problems/domino-and-tromino-tiling/)**
 > 
 > 题意: TODO
 
@@ -784,7 +784,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1621. 大小为 K 的不重叠线段的数目](https://leetcode-cn.com/problems/number-of-sets-of-k-non-overlapping-line-segments/)**
+> [!NOTE] **[LeetCode 1621. 大小为 K 的不重叠线段的数目](https://leetcode.cn/problems/number-of-sets-of-k-non-overlapping-line-segments/)**
 > 
 > 题意: TODO
 
@@ -849,7 +849,7 @@ public:
 
 ##### **C++ 转化 组合数**
 
-[题解](https://leetcode-cn.com/problems/number-of-sets-of-k-non-overlapping-line-segments/solution/da-xiao-wei-k-de-bu-zhong-die-xian-duan-de-shu-mu-/)
+[题解](https://leetcode.cn/problems/number-of-sets-of-k-non-overlapping-line-segments/solution/da-xiao-wei-k-de-bu-zhong-die-xian-duan-de-shu-mu-/)
 
 ```cpp
 class Solution {
@@ -1307,7 +1307,7 @@ public:
 
 ### 复杂线性
 
-> [!NOTE] **[LeetCode 689. 三个无重叠子数组的最大和](https://leetcode-cn.com/problems/maximum-sum-of-3-non-overlapping-subarrays/)**
+> [!NOTE] **[LeetCode 689. 三个无重叠子数组的最大和](https://leetcode.cn/problems/maximum-sum-of-3-non-overlapping-subarrays/)**
 > 
 > 题意: TODO
 
@@ -1404,7 +1404,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 740. 删除与获得点数](https://leetcode-cn.com/problems/delete-and-earn/)**
+> [!NOTE] **[LeetCode 740. 删除与获得点数](https://leetcode.cn/problems/delete-and-earn/)**
 > 
 > 题意: TODO
 
@@ -1645,7 +1645,7 @@ int main() {
 * * *
 
 
-> [!NOTE] **[LeetCode 1187. 使数组严格递增](https://leetcode-cn.com/problems/make-array-strictly-increasing/)** [TAG]
+> [!NOTE] **[LeetCode 1187. 使数组严格递增](https://leetcode.cn/problems/make-array-strictly-increasing/)** [TAG]
 > 
 > 题意: TODO
 
@@ -1710,7 +1710,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1223. 掷骰子模拟](https://leetcode-cn.com/problems/dice-roll-simulation/)**
+> [!NOTE] **[LeetCode 1223. 掷骰子模拟](https://leetcode.cn/problems/dice-roll-simulation/)**
 > 
 > 题意: TODO
 
@@ -1764,7 +1764,7 @@ int dieSimulator(int n, vector<int>& rollMax) {
 
 * * *
 
-> [!NOTE] **[LeetCode 1388. 3n 块披萨](https://leetcode-cn.com/problems/pizza-with-3n-slices/)** [TAG]
+> [!NOTE] **[LeetCode 1388. 3n 块披萨](https://leetcode.cn/problems/pizza-with-3n-slices/)** [TAG]
 > 
 > 题意: 
 > 
@@ -1824,13 +1824,13 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1478. 安排邮筒](https://leetcode-cn.com/problems/allocate-mailboxes/)**
+> [!NOTE] **[LeetCode 1478. 安排邮筒](https://leetcode.cn/problems/allocate-mailboxes/)**
 > 
 > 题意: TODO
 
 > [!TIP] **思路**
 >
-> [何逊的题解](https://leetcode-cn.com/problems/allocate-mailboxes/solution/dong-tai-gui-hua-shi-jian-fu-za-du-oknlognkong-jia/)
+> [何逊的题解](https://leetcode.cn/problems/allocate-mailboxes/solution/dong-tai-gui-hua-shi-jian-fu-za-du-oknlognkong-jia/)
 >
 > $f[i, j] 表示前 i 个建筑用 j 个邮箱的最短距离和 预处理 dis[i, j]为从 i 到 j 使用一个邮箱时的消耗$
 >
@@ -1886,7 +1886,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1575. 统计所有可行路径](https://leetcode-cn.com/problems/count-all-possible-routes/)** [TAG]
+> [!NOTE] **[LeetCode 1575. 统计所有可行路径](https://leetcode.cn/problems/count-all-possible-routes/)** [TAG]
 > 
 > 题意: TODO
 
@@ -1938,7 +1938,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1751. 最多可以参加的会议数目 II](https://leetcode-cn.com/problems/maximum-number-of-events-that-can-be-attended-ii/)**
+> [!NOTE] **[LeetCode 1751. 最多可以参加的会议数目 II](https://leetcode.cn/problems/maximum-number-of-events-that-can-be-attended-ii/)**
 > 
 > 题意: TODO
 
@@ -1999,7 +1999,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1787. 使所有区间的异或结果为零](https://leetcode-cn.com/problems/make-the-xor-of-all-segments-equal-to-zero/)** [TAG]
+> [!NOTE] **[LeetCode 1787. 使所有区间的异或结果为零](https://leetcode.cn/problems/make-the-xor-of-all-segments-equal-to-zero/)** [TAG]
 > 
 > 题意: TODO
 
@@ -2071,7 +2071,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1959. K 次调整数组大小浪费的最小总空间](https://leetcode-cn.com/problems/minimum-total-space-wasted-with-k-resizing-operations/)**
+> [!NOTE] **[LeetCode 1959. K 次调整数组大小浪费的最小总空间](https://leetcode.cn/problems/minimum-total-space-wasted-with-k-resizing-operations/)**
 > 
 > 题意: TODO
 
@@ -2218,7 +2218,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1997. 访问完所有房间的第一天](https://leetcode-cn.com/problems/first-day-where-you-have-been-in-all-the-rooms/)** [TAG]
+> [!NOTE] **[LeetCode 1997. 访问完所有房间的第一天](https://leetcode.cn/problems/first-day-where-you-have-been-in-all-the-rooms/)** [TAG]
 > 
 > 题意: TODO
 
@@ -2280,7 +2280,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2008. 出租车的最大盈利](https://leetcode-cn.com/problems/maximum-earnings-from-taxi/)** [TAG]
+> [!NOTE] **[LeetCode 2008. 出租车的最大盈利](https://leetcode.cn/problems/maximum-earnings-from-taxi/)** [TAG]
 > 
 > 题意: TODO
 
@@ -2866,7 +2866,7 @@ public:
 
 ### 股票问题
 
-> [!NOTE] **[LeetCode 121. 买卖股票的最佳时机](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/)**
+> [!NOTE] **[LeetCode 121. 买卖股票的最佳时机](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock/)**
 > 
 > 题意: TODO
 
@@ -2960,7 +2960,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 122. 买卖股票的最佳时机 II](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/)**
+> [!NOTE] **[LeetCode 122. 买卖股票的最佳时机 II](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/)**
 > 
 > 题意: TODO
 
@@ -3085,7 +3085,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 123. 买卖股票的最佳时机 III](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iii/)**
+> [!NOTE] **[LeetCode 123. 买卖股票的最佳时机 III](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-iii/)**
 > 
 > 题意: TODO
 
@@ -3209,7 +3209,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 188. 买卖股票的最佳时机 IV](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iv/)**
+> [!NOTE] **[LeetCode 188. 买卖股票的最佳时机 IV](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-iv/)**
 > 
 > 题意: TODO
 
@@ -3385,7 +3385,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 309. 最佳买卖股票时机含冷冻期](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/)**
+> [!NOTE] **[LeetCode 309. 最佳买卖股票时机含冷冻期](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-cooldown/)**
 > 
 > 题意: TODO
 
@@ -3513,7 +3513,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 714. 买卖股票的最佳时机含手续费](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/)**
+> [!NOTE] **[LeetCode 714. 买卖股票的最佳时机含手续费](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/)**
 > 
 > 题意: TODO
 
@@ -3719,7 +3719,7 @@ int main() {
 
 ### 打家劫舍
 
-> [!NOTE] **[LeetCode 198. 打家劫舍](https://leetcode-cn.com/problems/house-robber/)**
+> [!NOTE] **[LeetCode 198. 打家劫舍](https://leetcode.cn/problems/house-robber/)**
 > 
 > 题意: TODO
 
@@ -3818,7 +3818,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 213. 打家劫舍 II](https://leetcode-cn.com/problems/house-robber-ii/)**
+> [!NOTE] **[LeetCode 213. 打家劫舍 II](https://leetcode.cn/problems/house-robber-ii/)**
 > 
 > 题意: TODO
 
@@ -3911,7 +3911,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 337. 打家劫舍 III](https://leetcode-cn.com/problems/house-robber-iii/)**
+> [!NOTE] **[LeetCode 337. 打家劫舍 III](https://leetcode.cn/problems/house-robber-iii/)**
 > 
 > 题意: TODO
 
@@ -3996,7 +3996,7 @@ class Solution:
 
 ### 一般递推
 
-> [!NOTE] **[LeetCode 799. 香槟塔](https://leetcode-cn.com/problems/champagne-tower/)**
+> [!NOTE] **[LeetCode 799. 香槟塔](https://leetcode.cn/problems/champagne-tower/)**
 > 
 > 题意: TODO
 
@@ -4064,7 +4064,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1182. 与目标颜色间的最短距离](https://leetcode-cn.com/problems/shortest-distance-to-target-color/)** [TAG]
+> [!NOTE] **[LeetCode 1182. 与目标颜色间的最短距离](https://leetcode.cn/problems/shortest-distance-to-target-color/)** [TAG]
 > 
 > 题意: TODO
 
@@ -4209,7 +4209,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1220. 统计元音字母序列的数目](https://leetcode-cn.com/problems/count-vowels-permutation/)**
+> [!NOTE] **[LeetCode 1220. 统计元音字母序列的数目](https://leetcode.cn/problems/count-vowels-permutation/)**
 > 
 > 题意: TODO
 
@@ -4293,7 +4293,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1262. 可被三整除的最大和](https://leetcode-cn.com/problems/greatest-sum-divisible-by-three/)** [TAG]
+> [!NOTE] **[LeetCode 1262. 可被三整除的最大和](https://leetcode.cn/problems/greatest-sum-divisible-by-three/)** [TAG]
 > 
 > 题意: TODO
 
@@ -4370,7 +4370,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1335. 工作计划的最低难度](https://leetcode-cn.com/problems/minimum-difficulty-of-a-job-schedule/)**
+> [!NOTE] **[LeetCode 1335. 工作计划的最低难度](https://leetcode.cn/problems/minimum-difficulty-of-a-job-schedule/)**
 > 
 > 题意: TODO
 
@@ -4450,7 +4450,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1639. 通过给定词典构造目标字符串的方案数](https://leetcode-cn.com/problems/number-of-ways-to-form-a-target-string-given-a-dictionary/)** [TAG]
+> [!NOTE] **[LeetCode 1639. 通过给定词典构造目标字符串的方案数](https://leetcode.cn/problems/number-of-ways-to-form-a-target-string-given-a-dictionary/)** [TAG]
 > 
 > 题意: TODO
 
@@ -4497,7 +4497,7 @@ class Solution {
 
 * * *
 
-> [!NOTE] **[LeetCode 1680. 连接连续二进制数字](https://leetcode-cn.com/problems/concatenation-of-consecutive-binary-numbers/)**
+> [!NOTE] **[LeetCode 1680. 连接连续二进制数字](https://leetcode.cn/problems/concatenation-of-consecutive-binary-numbers/)**
 > 
 > 题意: TODO
 
@@ -4577,7 +4577,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1955. 统计特殊子序列的数目](https://leetcode-cn.com/problems/count-number-of-special-subsequences/)**
+> [!NOTE] **[LeetCode 1955. 统计特殊子序列的数目](https://leetcode.cn/problems/count-number-of-special-subsequences/)**
 > 
 > 题意: TODO
 
@@ -5138,7 +5138,7 @@ public:
 
 #### 数学递推 dp
 
-> [!NOTE] **[LeetCode 1259. 不相交的握手](https://leetcode-cn.com/problems/handshakes-that-dont-cross/)** [TAG]
+> [!NOTE] **[LeetCode 1259. 不相交的握手](https://leetcode.cn/problems/handshakes-that-dont-cross/)** [TAG]
 > 
 > 题意: TODO
 
@@ -5188,7 +5188,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1269. 停在原地的方案数](https://leetcode-cn.com/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps/)** [TAG]
+> [!NOTE] **[LeetCode 1269. 停在原地的方案数](https://leetcode.cn/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps/)** [TAG]
 > 
 > 题意: TODO
 
@@ -5396,7 +5396,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1411. 给 N x 3 网格图涂色的方案数](https://leetcode-cn.com/problems/number-of-ways-to-paint-n-x-3-grid/)**
+> [!NOTE] **[LeetCode 1411. 给 N x 3 网格图涂色的方案数](https://leetcode.cn/problems/number-of-ways-to-paint-n-x-3-grid/)**
 > 
 > 题意: TODO
 
@@ -5440,7 +5440,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1420. 生成数组](https://leetcode-cn.com/problems/build-array-where-you-can-find-the-maximum-exactly-k-comparisons/)** [TAG]
+> [!NOTE] **[LeetCode 1420. 生成数组](https://leetcode.cn/problems/build-array-where-you-can-find-the-maximum-exactly-k-comparisons/)** [TAG]
 > 
 > 题意: TODO
 
@@ -5514,7 +5514,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1473. 粉刷房子 III](https://leetcode-cn.com/problems/paint-house-iii/)**
+> [!NOTE] **[LeetCode 1473. 粉刷房子 III](https://leetcode.cn/problems/paint-house-iii/)**
 > 
 > 题意: TODO
 
@@ -5577,7 +5577,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1739. 放置盒子](https://leetcode-cn.com/problems/building-boxes/)** [TAG]
+> [!NOTE] **[LeetCode 1739. 放置盒子](https://leetcode.cn/problems/building-boxes/)** [TAG]
 > 
 > 题意: TODO
 
@@ -5702,7 +5702,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1883. 准时抵达会议现场的最小跳过休息次数](https://leetcode-cn.com/problems/minimum-skips-to-arrive-at-meeting-on-time/)** [TAG]
+> [!NOTE] **[LeetCode 1883. 准时抵达会议现场的最小跳过休息次数](https://leetcode.cn/problems/minimum-skips-to-arrive-at-meeting-on-time/)** [TAG]
 > 
 > 题意: TODO
 
@@ -5787,7 +5787,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1987. 不同的好子序列数目](https://leetcode-cn.com/problems/number-of-unique-good-subsequences/)** [TAG]
+> [!NOTE] **[LeetCode 1987. 不同的好子序列数目](https://leetcode.cn/problems/number-of-unique-good-subsequences/)** [TAG]
 > 
 > 题意: TODO
 
@@ -5851,7 +5851,7 @@ public:
 
 #### 栅栏涂色
 
-> [!NOTE] **[LeetCode 276. 栅栏涂色](https://leetcode-cn.com/problems/paint-fence/)**
+> [!NOTE] **[LeetCode 276. 栅栏涂色](https://leetcode.cn/problems/paint-fence/)**
 > 
 > 题意: TODO
 
@@ -5967,7 +5967,7 @@ public:
 
 ### 分层最短路
 
-> [!NOTE] **[LeetCode 1824. 最少侧跳次数](https://leetcode-cn.com/problems/minimum-sideway-jumps/)** [TAG]
+> [!NOTE] **[LeetCode 1824. 最少侧跳次数](https://leetcode.cn/problems/minimum-sideway-jumps/)** [TAG]
 > 
 > 题意: TODO
 
diff --git a/dp/memo.md b/dp/memo.md
index 4751207..3c18cc8 100644
--- a/dp/memo.md
+++ b/dp/memo.md
@@ -105,7 +105,7 @@ if __name__ == '__main__':
 
 * * *
 
-> [!NOTE] **[LeetCode 329. 矩阵中的最长递增路径](https://leetcode-cn.com/problems/longest-increasing-path-in-a-matrix/)**
+> [!NOTE] **[LeetCode 329. 矩阵中的最长递增路径](https://leetcode.cn/problems/longest-increasing-path-in-a-matrix/)**
 > 
 > 题意: TODO
 
@@ -291,7 +291,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 403. 青蛙过河](https://leetcode-cn.com/problems/frog-jump/)**
+> [!NOTE] **[LeetCode 403. 青蛙过河](https://leetcode.cn/problems/frog-jump/)**
 > 
 > 题意: TODO
 
@@ -441,7 +441,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 464. 我能赢吗](https://leetcode-cn.com/problems/can-i-win/)**
+> [!NOTE] **[LeetCode 464. 我能赢吗](https://leetcode.cn/problems/can-i-win/)**
 > 
 > 题意: TODO
 
@@ -599,7 +599,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1240. 铺瓷砖](https://leetcode-cn.com/problems/tiling-a-rectangle-with-the-fewest-squares/)**
+> [!NOTE] **[LeetCode 1240. 铺瓷砖](https://leetcode.cn/problems/tiling-a-rectangle-with-the-fewest-squares/)**
 > 
 > 题意: TODO
 
@@ -706,7 +706,7 @@ int tilingRectangle(int n, int m) {
 
 * * *
 
-> [!NOTE] **[LeetCode 1553. 吃掉 N 个橘子的最少天数](https://leetcode-cn.com/problems/minimum-number-of-days-to-eat-n-oranges/)**
+> [!NOTE] **[LeetCode 1553. 吃掉 N 个橘子的最少天数](https://leetcode.cn/problems/minimum-number-of-days-to-eat-n-oranges/)**
 > 
 > 题意: TODO
 
diff --git a/dp/misc.md b/dp/misc.md
index 545bf3a..98faaca 100644
--- a/dp/misc.md
+++ b/dp/misc.md
@@ -1,6 +1,6 @@
 ## 习题
 
-> [!NOTE] **[LeetCode 1889. 装包裹的最小浪费空间](https://leetcode-cn.com/problems/minimum-space-wasted-from-packaging/)** [TAG]
+> [!NOTE] **[LeetCode 1889. 装包裹的最小浪费空间](https://leetcode.cn/problems/minimum-space-wasted-from-packaging/)** [TAG]
 > 
 > 题意: TODO
 
@@ -173,7 +173,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1937. 扣分后的最大得分](https://leetcode-cn.com/problems/maximum-number-of-points-with-cost/)** [TAG]
+> [!NOTE] **[LeetCode 1937. 扣分后的最大得分](https://leetcode.cn/problems/maximum-number-of-points-with-cost/)** [TAG]
 > 
 > 题意: TODO
 
@@ -242,7 +242,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1977. 划分数字的方案数](https://leetcode-cn.com/problems/number-of-ways-to-separate-numbers/)** [TAG]
+> [!NOTE] **[LeetCode 1977. 划分数字的方案数](https://leetcode.cn/problems/number-of-ways-to-separate-numbers/)** [TAG]
 > 
 > 题意: TODO
 
diff --git a/dp/number.md b/dp/number.md
index 9dede5c..632de68 100644
--- a/dp/number.md
+++ b/dp/number.md
@@ -1211,7 +1211,7 @@ int main() {
 
 ### LeetCode 基础
 
-> [!NOTE] **[LeetCode 233. 数字 1 的个数](https://leetcode-cn.com/problems/number-of-digit-one/)**
+> [!NOTE] **[LeetCode 233. 数字 1 的个数](https://leetcode.cn/problems/number-of-digit-one/)**
 > 
 > 题意: TODO
 
@@ -1347,7 +1347,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 600. 不含连续1的非负整数](https://leetcode-cn.com/problems/non-negative-integers-without-consecutive-ones/)**
+> [!NOTE] **[LeetCode 600. 不含连续1的非负整数](https://leetcode.cn/problems/non-negative-integers-without-consecutive-ones/)**
 > 
 > 题意: TODO
 
@@ -1445,7 +1445,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1397. 找到所有好字符串](https://leetcode-cn.com/problems/find-all-good-strings/)** [TAG]
+> [!NOTE] **[LeetCode 1397. 找到所有好字符串](https://leetcode.cn/problems/find-all-good-strings/)** [TAG]
 > 
 > 题意: TODO
 
diff --git a/dp/opt/monotonous-queue-stack.md b/dp/opt/monotonous-queue-stack.md
index 8a6ac7b..8165012 100644
--- a/dp/opt/monotonous-queue-stack.md
+++ b/dp/opt/monotonous-queue-stack.md
@@ -540,7 +540,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1687. 从仓库到码头运输箱子](https://leetcode-cn.com/problems/delivering-boxes-from-storage-to-ports/)** [TAG]
+> [!NOTE] **[LeetCode 1687. 从仓库到码头运输箱子](https://leetcode.cn/problems/delivering-boxes-from-storage-to-ports/)** [TAG]
 > 
 > 题意: TODO
 
@@ -616,7 +616,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1696. 跳跃游戏 VI](https://leetcode-cn.com/problems/jump-game-vi/)**
+> [!NOTE] **[LeetCode 1696. 跳跃游戏 VI](https://leetcode.cn/problems/jump-game-vi/)**
 > 
 > 题意: TODO
 
diff --git a/dp/opt/slope.md b/dp/opt/slope.md
index 18da312..0291b4e 100644
--- a/dp/opt/slope.md
+++ b/dp/opt/slope.md
@@ -470,7 +470,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1776. 车队 II](https://leetcode-cn.com/problems/car-fleet-ii/)** [TAG]
+> [!NOTE] **[LeetCode 1776. 车队 II](https://leetcode.cn/problems/car-fleet-ii/)** [TAG]
 > 
 > 题意: TODO
 
diff --git a/dp/probability.md b/dp/probability.md
index d615d6c..33db467 100644
--- a/dp/probability.md
+++ b/dp/probability.md
@@ -247,7 +247,7 @@ int main() {
 
 ## 习题
 
-> [!NOTE] **[LeetCode 1377. T 秒后青蛙的位置](https://leetcode-cn.com/problems/frog-position-after-t-seconds/)** [TAG]
+> [!NOTE] **[LeetCode 1377. T 秒后青蛙的位置](https://leetcode.cn/problems/frog-position-after-t-seconds/)** [TAG]
 > 
 > 题意: 
 > 
@@ -801,7 +801,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1467. 两个盒子中球的颜色数相同的概率](https://leetcode-cn.com/problems/probability-of-a-two-boxes-having-the-same-number-of-distinct-balls/)** [TAG]
+> [!NOTE] **[LeetCode 1467. 两个盒子中球的颜色数相同的概率](https://leetcode.cn/problems/probability-of-a-two-boxes-having-the-same-number-of-distinct-balls/)** [TAG]
 > 
 > 题意: TODO
 
@@ -809,7 +809,7 @@ public:
 > 
 > dp + 组合数
 > 
-> [题解](https://leetcode-cn.com/problems/probability-of-a-two-boxes-having-the-same-number-of-distinct-balls/solution/cdong-tai-gui-hua-bi-sai-de-shi-hou-bei-fan-yi-ken/)
+> [题解](https://leetcode.cn/problems/probability-of-a-two-boxes-having-the-same-number-of-distinct-balls/solution/cdong-tai-gui-hua-bi-sai-de-shi-hou-bei-fan-yi-ken/)
 > 
 > 重复做 todo
 
diff --git a/dp/state.md b/dp/state.md
index eb177ac..8d06177 100644
--- a/dp/state.md
+++ b/dp/state.md
@@ -2,7 +2,7 @@
 >
 > **经典线性优化 状压递推复杂度 $O(n^2)$ -> $O(n)$**
 > 
-> 例: **[LeetCode 1723. 完成所有工作的最短时间](https://leetcode-cn.com/problems/find-minimum-time-to-finish-all-jobs/)**
+> 例: **[LeetCode 1723. 完成所有工作的最短时间](https://leetcode.cn/problems/find-minimum-time-to-finish-all-jobs/)**
 >
 > ```cpp
 > // 写法1
@@ -214,7 +214,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1255. 得分最高的单词集合](https://leetcode-cn.com/problems/maximum-score-words-formed-by-letters/)**
+> [!NOTE] **[LeetCode 1255. 得分最高的单词集合](https://leetcode.cn/problems/maximum-score-words-formed-by-letters/)**
 > 
 > 题意: TODO
 
@@ -276,7 +276,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1601. 最多可达成的换楼请求数目](https://leetcode-cn.com/problems/maximum-number-of-achievable-transfer-requests/)**
+> [!NOTE] **[LeetCode 1601. 最多可达成的换楼请求数目](https://leetcode.cn/problems/maximum-number-of-achievable-transfer-requests/)**
 > 
 > 题意: TODO
 
@@ -330,7 +330,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1617. 统计子树中城市之间最大距离](https://leetcode-cn.com/problems/count-subtrees-with-max-distance-between-cities/)** [TAG]
+> [!NOTE] **[LeetCode 1617. 统计子树中城市之间最大距离](https://leetcode.cn/problems/count-subtrees-with-max-distance-between-cities/)** [TAG]
 > 
 > 题意: TODO
 
@@ -410,7 +410,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1681. 最小不兼容性](https://leetcode-cn.com/problems/minimum-incompatibility/)** [TAG]
+> [!NOTE] **[LeetCode 1681. 最小不兼容性](https://leetcode.cn/problems/minimum-incompatibility/)** [TAG]
 > 
 > 题意: TODO
 
@@ -487,7 +487,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2002. 两个回文子序列长度的最大乘积](https://leetcode-cn.com/problems/maximum-product-of-the-length-of-two-palindromic-subsequences/)**
+> [!NOTE] **[LeetCode 2002. 两个回文子序列长度的最大乘积](https://leetcode.cn/problems/maximum-product-of-the-length-of-two-palindromic-subsequences/)**
 > 
 > 题意: TODO
 
@@ -1368,7 +1368,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1434. 每个人戴不同帽子的方案数](https://leetcode-cn.com/problems/number-of-ways-to-wear-different-hats-to-each-other/)** [TAG]
+> [!NOTE] **[LeetCode 1434. 每个人戴不同帽子的方案数](https://leetcode.cn/problems/number-of-ways-to-wear-different-hats-to-each-other/)** [TAG]
 > 
 > 题意: TODO
 
@@ -1505,7 +1505,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1655. 分配重复整数](https://leetcode-cn.com/problems/distribute-repeating-integers/)**
+> [!NOTE] **[LeetCode 1655. 分配重复整数](https://leetcode.cn/problems/distribute-repeating-integers/)**
 > 
 > 题意: TODO
 
@@ -1568,7 +1568,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1799. N 次操作后的最大分数和](https://leetcode-cn.com/problems/maximize-score-after-n-operations/)**
+> [!NOTE] **[LeetCode 1799. N 次操作后的最大分数和](https://leetcode.cn/problems/maximize-score-after-n-operations/)**
 > 
 > 题意: TODO
 
@@ -1616,7 +1616,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1947. 最大兼容性评分和](https://leetcode-cn.com/problems/maximum-compatibility-score-sum/)**
+> [!NOTE] **[LeetCode 1947. 最大兼容性评分和](https://leetcode.cn/problems/maximum-compatibility-score-sum/)**
 > 
 > 题意: TODO
 
@@ -1694,7 +1694,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1986. 完成任务的最少工作时间段](https://leetcode-cn.com/problems/minimum-number-of-work-sessions-to-finish-the-tasks/)**
+> [!NOTE] **[LeetCode 1986. 完成任务的最少工作时间段](https://leetcode.cn/problems/minimum-number-of-work-sessions-to-finish-the-tasks/)**
 > 
 > 题意: TODO
 
@@ -2196,7 +2196,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 526. 优美的排列](https://leetcode-cn.com/problems/beautiful-arrangement/)**
+> [!NOTE] **[LeetCode 526. 优美的排列](https://leetcode.cn/problems/beautiful-arrangement/)**
 > 
 > 题意: TODO
 
@@ -2274,7 +2274,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1349. 参加考试的最大学生数](https://leetcode-cn.com/problems/maximum-students-taking-exam/)** [TAG]
+> [!NOTE] **[LeetCode 1349. 参加考试的最大学生数](https://leetcode.cn/problems/maximum-students-taking-exam/)** [TAG]
 > 
 > 题意: TODO
 
@@ -2465,7 +2465,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1494. 并行课程 II](https://leetcode-cn.com/problems/parallel-courses-ii/)** [TAG]
+> [!NOTE] **[LeetCode 1494. 并行课程 II](https://leetcode.cn/problems/parallel-courses-ii/)** [TAG]
 > 
 > 题意: TODO
 
@@ -2876,7 +2876,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 691. 贴纸拼词](https://leetcode-cn.com/problems/stickers-to-spell-word/)**
+> [!NOTE] **[LeetCode 691. 贴纸拼词](https://leetcode.cn/problems/stickers-to-spell-word/)**
 > 
 > 题意: TODO
 
@@ -3019,7 +3019,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1595. 连通两组点的最小成本](https://leetcode-cn.com/problems/minimum-cost-to-connect-two-groups-of-points/)** [TAG]
+> [!NOTE] **[LeetCode 1595. 连通两组点的最小成本](https://leetcode.cn/problems/minimum-cost-to-connect-two-groups-of-points/)** [TAG]
 > 
 > 题意: TODO
 
@@ -3091,7 +3091,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1723. 完成所有工作的最短时间](https://leetcode-cn.com/problems/find-minimum-time-to-finish-all-jobs/)** [TAG]
+> [!NOTE] **[LeetCode 1723. 完成所有工作的最短时间](https://leetcode.cn/problems/find-minimum-time-to-finish-all-jobs/)** [TAG]
 > 
 > 题意: TODO
 
@@ -3259,7 +3259,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1879. 两个数组最小的异或值之和](https://leetcode-cn.com/problems/minimum-xor-sum-of-two-arrays/)** [TAG]
+> [!NOTE] **[LeetCode 1879. 两个数组最小的异或值之和](https://leetcode.cn/problems/minimum-xor-sum-of-two-arrays/)** [TAG]
 > 
 > 题意: TODO
 
@@ -3520,7 +3520,7 @@ public:
 
 对于三进制的状态压缩题目，可以考虑使用 `limit << 1` 的形式也可以使用 `pow(3, M)` 的形式
 
-> [!NOTE] **[LeetCode 1774. 最接近目标价格的甜点成本](https://leetcode-cn.com/problems/closest-dessert-cost/)**
+> [!NOTE] **[LeetCode 1774. 最接近目标价格的甜点成本](https://leetcode.cn/problems/closest-dessert-cost/)**
 > 
 > [weekly-230](https://github.com/OpenKikCoc/LeetCode/tree/master/Contest/2021-02-28_Weekly-230)
 > 
@@ -3639,7 +3639,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1931. 用三种不同颜色为网格涂色](https://leetcode-cn.com/problems/painting-a-grid-with-three-different-colors/)**
+> [!NOTE] **[LeetCode 1931. 用三种不同颜色为网格涂色](https://leetcode.cn/problems/painting-a-grid-with-three-different-colors/)**
 > 
 > [weekly-249](https://github.com/OpenKikCoc/LeetCode/tree/master/Contest/2021-07-11_Weekly-249)
 > 
@@ -3647,7 +3647,7 @@ public:
 
 > [!TIP] **思路**
 > 
-> dp思路简单版 [1411. 给 N x 3 网格图涂色的方案数](https://leetcode-cn.com/problems/number-of-ways-to-paint-n-3-grid/)
+> dp思路简单版 [1411. 给 N x 3 网格图涂色的方案数](https://leetcode.cn/problems/number-of-ways-to-paint-n-3-grid/)
 > 
 > 之前想用 01 10 11 表示三进制状态，但实现起来非常麻烦
 > 
@@ -3796,7 +3796,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1659. 最大化网格幸福感](https://leetcode-cn.com/problems/maximize-grid-happiness/)** [TAG]
+> [!NOTE] **[LeetCode 1659. 最大化网格幸福感](https://leetcode.cn/problems/maximize-grid-happiness/)** [TAG]
 > 
 > [weekly-215](https://github.com/OpenKikCoc/LeetCode/tree/master/Contest/2020-11-15_Weekly-215)
 > 
@@ -3913,7 +3913,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2172. 数组的最大与和](https://leetcode-cn.com/problems/maximum-and-sum-of-array/)** [TAG]
+> [!NOTE] **[LeetCode 2172. 数组的最大与和](https://leetcode.cn/problems/maximum-and-sum-of-array/)** [TAG]
 > 
 > 题意: TODO
 
@@ -4021,7 +4021,7 @@ public:
 
 ### 八进制状压
 
-> [!NOTE] **[LeetCode 638. 大礼包](https://leetcode-cn.com/problems/shopping-offers/)**
+> [!NOTE] **[LeetCode 638. 大礼包](https://leetcode.cn/problems/shopping-offers/)**
 > 
 > 题意: TODO
 
@@ -4111,7 +4111,7 @@ public:
 
 ### 状压 + 记忆化搜索
 
-> [!NOTE] **[LeetCode 1900. 最佳运动员的比拼回合](https://leetcode-cn.com/problems/the-earliest-and-latest-rounds-where-players-compete/)**
+> [!NOTE] **[LeetCode 1900. 最佳运动员的比拼回合](https://leetcode.cn/problems/the-earliest-and-latest-rounds-where-players-compete/)**
 > 
 > 题意: TODO
 
@@ -4202,7 +4202,7 @@ public:
 
 ### 状压 + 枚举子集 + 组合计数
 
-> [!NOTE] **[LeetCode 1994. 好子集的数目](https://leetcode-cn.com/problems/the-number-of-good-subsets/)** [TAG]
+> [!NOTE] **[LeetCode 1994. 好子集的数目](https://leetcode.cn/problems/the-number-of-good-subsets/)** [TAG]
 > 
 > 题意: TODO
 
@@ -4406,7 +4406,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 合作开发](https://leetcode-cn.com/contest/cnunionpay-2022spring/problems/lCh58I/)**
+> [!NOTE] **[LeetCode 合作开发](https://leetcode.cn/contest/cnunionpay-2022spring/problems/lCh58I/)**
 > 
 > 题意: TODO
 
@@ -4484,7 +4484,7 @@ public:
 
 ### 状压 + meet in the middle
 
-> [!NOTE] **[LeetCode 2035. 将数组分成两个数组并最小化数组和的差](https://leetcode-cn.com/problems/partition-array-into-two-arrays-to-minimize-sum-difference/)**
+> [!NOTE] **[LeetCode 2035. 将数组分成两个数组并最小化数组和的差](https://leetcode.cn/problems/partition-array-into-two-arrays-to-minimize-sum-difference/)**
 > 
 > [weekly-262](https://github.com/OpenKikCoc/LeetCode/tree/master/Contest/2021-10-10_Weekly-262)
 > 
@@ -4578,7 +4578,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1755. 最接近目标值的子序列和](https://leetcode-cn.com/problems/closest-subsequence-sum/)** [TAG]
+> [!NOTE] **[LeetCode 1755. 最接近目标值的子序列和](https://leetcode.cn/problems/closest-subsequence-sum/)** [TAG]
 > 
 > 题意: TODO
 
diff --git a/dp/tree.md b/dp/tree.md
index ed76bde..139474d 100644
--- a/dp/tree.md
+++ b/dp/tree.md
@@ -1085,7 +1085,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1372. 二叉树中的最长交错路径](https://leetcode-cn.com/problems/longest-zigzag-path-in-a-binary-tree/)**
+> [!NOTE] **[LeetCode 1372. 二叉树中的最长交错路径](https://leetcode.cn/problems/longest-zigzag-path-in-a-binary-tree/)**
 > 
 > 题意: TODO
 
@@ -1160,7 +1160,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1373. 二叉搜索子树的最大键值和](https://leetcode-cn.com/problems/maximum-sum-bst-in-binary-tree/)** [TAG]
+> [!NOTE] **[LeetCode 1373. 二叉搜索子树的最大键值和](https://leetcode.cn/problems/maximum-sum-bst-in-binary-tree/)** [TAG]
 > 
 > 题意: 
 > 
@@ -1217,7 +1217,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode LCP 34. 二叉树染色](https://leetcode-cn.com/problems/er-cha-shu-ran-se-UGC/)**
+> [!NOTE] **[LeetCode LCP 34. 二叉树染色](https://leetcode.cn/problems/er-cha-shu-ran-se-UGC/)**
 > 
 > 题意: TODO
 
@@ -2227,7 +2227,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 310. 最小高度树](https://leetcode-cn.com/problems/minimum-height-trees/)**
+> [!NOTE] **[LeetCode 310. 最小高度树](https://leetcode.cn/problems/minimum-height-trees/)**
 > 
 > 题意: TODO
 
@@ -3146,7 +3146,7 @@ public:
 > [!TIP] **思路**
 > 与leetcode看守题不同之处在于：这个是看边 leetcode是看节点
 > 
-> https://leetcode-cn.com/problems/binary-tree-cameras/
+> https://leetcode.cn/problems/binary-tree-cameras/
 > 
 > - f[i] 没有放置也没有被覆盖的不考虑
 > - f[i][0] i节点没有放置 覆盖全部边
diff --git a/ds/binary-heap.md b/ds/binary-heap.md
index b9a348c..4e300b4 100644
--- a/ds/binary-heap.md
+++ b/ds/binary-heap.md
@@ -242,7 +242,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 295. 数据流的中位数](https://leetcode-cn.com/problems/find-median-from-data-stream/)**
+> [!NOTE] **[LeetCode 295. 数据流的中位数](https://leetcode.cn/problems/find-median-from-data-stream/)**
 > 
 > 题意: TODO
 
diff --git a/ds/binary-tree.md b/ds/binary-tree.md
index 97ec972..982dc63 100644
--- a/ds/binary-tree.md
+++ b/ds/binary-tree.md
@@ -2,7 +2,7 @@
 
 ### 重建二叉树
 
-> [!NOTE] **[LeetCode 105. 从前序与中序遍历序列构造二叉树](https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/)**
+> [!NOTE] **[LeetCode 105. 从前序与中序遍历序列构造二叉树](https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-inorder-traversal/)**
 > 
 > **[SwordOffer ...]()**
 > 
@@ -79,7 +79,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 106. 从中序与后序遍历序列构造二叉树](https://leetcode-cn.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/)**
+> [!NOTE] **[LeetCode 106. 从中序与后序遍历序列构造二叉树](https://leetcode.cn/problems/construct-binary-tree-from-inorder-and-postorder-traversal/)**
 > 
 > 题意: TODO
 
@@ -156,7 +156,7 @@ class Solution:
 
 ### 转换
 
-> [!NOTE] **[LeetCode 114. 二叉树展开为链表](https://leetcode-cn.com/problems/flatten-binary-tree-to-linked-list/)**
+> [!NOTE] **[LeetCode 114. 二叉树展开为链表](https://leetcode.cn/problems/flatten-binary-tree-to-linked-list/)**
 > 
 > 题意: TODO
 
@@ -230,7 +230,7 @@ class Solution:
 
 ### 序列化
 
-> [!NOTE] **[LeetCode 297. 二叉树的序列化与反序列化](https://leetcode-cn.com/problems/serialize-and-deserialize-binary-tree/)**
+> [!NOTE] **[LeetCode 297. 二叉树的序列化与反序列化](https://leetcode.cn/problems/serialize-and-deserialize-binary-tree/)**
 > 
 > 题意: TODO
 
@@ -397,7 +397,7 @@ class Codec:
 
 * * *
 
-> [!NOTE] **[LeetCode 449. 序列化和反序列化二叉搜索树](https://leetcode-cn.com/problems/serialize-and-deserialize-bst/)**
+> [!NOTE] **[LeetCode 449. 序列化和反序列化二叉搜索树](https://leetcode.cn/problems/serialize-and-deserialize-bst/)**
 > 
 > 题意: TODO
 
@@ -509,7 +509,7 @@ public:
 
 ### 连接节点
 
-> [!NOTE] **[LeetCode 116. 填充每个节点的下一个右侧节点指针](https://leetcode-cn.com/problems/populating-next-right-pointers-in-each-node/)**
+> [!NOTE] **[LeetCode 116. 填充每个节点的下一个右侧节点指针](https://leetcode.cn/problems/populating-next-right-pointers-in-each-node/)**
 > 
 > 题意: TODO
 
@@ -587,7 +587,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 117. 填充每个节点的下一个右侧节点指针 II](https://leetcode-cn.com/problems/populating-next-right-pointers-in-each-node-ii/)**
+> [!NOTE] **[LeetCode 117. 填充每个节点的下一个右侧节点指针 II](https://leetcode.cn/problems/populating-next-right-pointers-in-each-node-ii/)**
 > 
 > 题意: TODO
 
@@ -682,7 +682,7 @@ class Solution:
 
 ### trick
 
-> [!NOTE] **[LeetCode 331. 验证二叉树的前序序列化](https://leetcode-cn.com/problems/verify-preorder-serialization-of-a-binary-tree/)**
+> [!NOTE] **[LeetCode 331. 验证二叉树的前序序列化](https://leetcode.cn/problems/verify-preorder-serialization-of-a-binary-tree/)**
 > 
 > 题意: TODO
 
diff --git a/ds/bst.md b/ds/bst.md
index b689db4..e1786e1 100644
--- a/ds/bst.md
+++ b/ds/bst.md
@@ -443,7 +443,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 729. 我的日程安排表 I](https://leetcode-cn.com/problems/my-calendar-i/)**
+> [!NOTE] **[LeetCode 729. 我的日程安排表 I](https://leetcode.cn/problems/my-calendar-i/)**
 > 
 > 题意: TODO
 
@@ -509,7 +509,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1825. 求出 MK 平均值](https://leetcode-cn.com/problems/finding-mk-average/)** [TAG]
+> [!NOTE] **[LeetCode 1825. 求出 MK 平均值](https://leetcode.cn/problems/finding-mk-average/)** [TAG]
 > 
 > 题意: TODO
 
@@ -617,7 +617,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2102. 序列顺序查询](https://leetcode-cn.com/problems/sequentially-ordinal-rank-tracker/)**
+> [!NOTE] **[LeetCode 2102. 序列顺序查询](https://leetcode.cn/problems/sequentially-ordinal-rank-tracker/)**
 > 
 > 题意: TODO
 
@@ -751,7 +751,7 @@ class SORTracker {
 
 ### BST
 
-> [!NOTE] **[LeetCode 98. 验证二叉搜索树](https://leetcode-cn.com/problems/validate-binary-search-tree/)**
+> [!NOTE] **[LeetCode 98. 验证二叉搜索树](https://leetcode.cn/problems/validate-binary-search-tree/)**
 > 
 > 题意: TODO
 
@@ -845,7 +845,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 173. 二叉搜索树迭代器](https://leetcode-cn.com/problems/binary-search-tree-iterator/)**
+> [!NOTE] **[LeetCode 173. 二叉搜索树迭代器](https://leetcode.cn/problems/binary-search-tree-iterator/)**
 > 
 > 题意: TODO
 
@@ -933,7 +933,7 @@ class BSTIterator:
 
 * * *
 
-> [!NOTE] **[LeetCode 99. 恢复二叉搜索树](https://leetcode-cn.com/problems/recover-binary-search-tree/)**
+> [!NOTE] **[LeetCode 99. 恢复二叉搜索树](https://leetcode.cn/problems/recover-binary-search-tree/)**
 > 
 > 题意: TODO
 
@@ -1023,7 +1023,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 450. 删除二叉搜索树中的节点](https://leetcode-cn.com/problems/delete-node-in-a-bst/)**
+> [!NOTE] **[LeetCode 450. 删除二叉搜索树中的节点](https://leetcode.cn/problems/delete-node-in-a-bst/)**
 > 
 > 题意: TODO
 
@@ -1077,7 +1077,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 501. 二叉搜索树中的众数](https://leetcode-cn.com/problems/find-mode-in-binary-search-tree/)**
+> [!NOTE] **[LeetCode 501. 二叉搜索树中的众数](https://leetcode.cn/problems/find-mode-in-binary-search-tree/)**
 > 
 > 题意: TODO
 
@@ -1187,7 +1187,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 701. 二叉搜索树中的插入操作](https://leetcode-cn.com/problems/insert-into-a-binary-search-tree/)**
+> [!NOTE] **[LeetCode 701. 二叉搜索树中的插入操作](https://leetcode.cn/problems/insert-into-a-binary-search-tree/)**
 > 
 > 题意: TODO
 
@@ -1245,7 +1245,7 @@ public:
 - 先序
 
   ```cpp
-  // [144. 二叉树的前序遍历](https://leetcode-cn.com/problems/binary-tree-preorder-traversal/)
+  // [144. 二叉树的前序遍历](https://leetcode.cn/problems/binary-tree-preorder-traversal/)
   class Solution {
   public:
       vector<int> preorderTraversal(TreeNode* root) {
@@ -1375,7 +1375,7 @@ public:
 
 ### 构造 BST
 
-> [!NOTE] **[LeetCode 108. 将有序数组转换为二叉搜索树](https://leetcode-cn.com/problems/convert-sorted-array-to-binary-search-tree/)**
+> [!NOTE] **[LeetCode 108. 将有序数组转换为二叉搜索树](https://leetcode.cn/problems/convert-sorted-array-to-binary-search-tree/)**
 > 
 > 题意: TODO
 
@@ -1431,7 +1431,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 109. 有序链表转换二叉搜索树](https://leetcode-cn.com/problems/convert-sorted-list-to-binary-search-tree/)**
+> [!NOTE] **[LeetCode 109. 有序链表转换二叉搜索树](https://leetcode.cn/problems/convert-sorted-list-to-binary-search-tree/)**
 > 
 > 题意: TODO
 
diff --git a/ds/classic.md b/ds/classic.md
index 4122f42..afe4857 100644
--- a/ds/classic.md
+++ b/ds/classic.md
@@ -2,7 +2,7 @@
 
 ### 栈与队列
 
-> [!NOTE] **[SwordOffer 09. 用两个栈实现队列](https://leetcode-cn.com/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof/)**
+> [!NOTE] **[SwordOffer 09. 用两个栈实现队列](https://leetcode.cn/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof/)**
 > 
 > 题意: TODO
 
@@ -135,7 +135,7 @@ class MyQueue(object):
 
 * * *
 
-> [!NOTE] **[LeetCode 225. 用队列实现栈](https://leetcode-cn.com/problems/implement-stack-using-queues/)**
+> [!NOTE] **[LeetCode 225. 用队列实现栈](https://leetcode.cn/problems/implement-stack-using-queues/)**
 > 
 > 题意: TODO
 
@@ -260,7 +260,7 @@ class MyStack:
 
 * * *
 
-> [!NOTE] **[LeetCode 232. 用栈实现队列](https://leetcode-cn.com/problems/implement-queue-using-stacks/)**
+> [!NOTE] **[LeetCode 232. 用栈实现队列](https://leetcode.cn/problems/implement-queue-using-stacks/)**
 > 
 > 题意: TODO
 
@@ -375,7 +375,7 @@ class MyQueue:
 
 ### 栈
 
-> [!NOTE] **[SwordOffer 30. 包含min函数的栈](https://leetcode-cn.com/problems/bao-han-minhan-shu-de-zhan-lcof/)**
+> [!NOTE] **[SwordOffer 30. 包含min函数的栈](https://leetcode.cn/problems/bao-han-minhan-shu-de-zhan-lcof/)**
 > 
 > 题意: TODO
 
@@ -461,7 +461,7 @@ class MinStack(object):
 
 * * *
 
-> [!NOTE] **[SwordOffer 31. 栈的压入、弹出序列](https://leetcode-cn.com/problems/zhan-de-ya-ru-dan-chu-xu-lie-lcof/)**
+> [!NOTE] **[SwordOffer 31. 栈的压入、弹出序列](https://leetcode.cn/problems/zhan-de-ya-ru-dan-chu-xu-lie-lcof/)**
 > 
 > 题意: TODO
 
diff --git a/ds/dsu-app.md b/ds/dsu-app.md
index ea6a2a4..4ad29c8 100644
--- a/ds/dsu-app.md
+++ b/ds/dsu-app.md
@@ -120,7 +120,7 @@
 
 ### 一般联通性质
 
-> [!NOTE] **[LeetCode 1562. 查找大小为 M 的最新分组](https://leetcode-cn.com/problems/find-latest-group-of-size-m/)**
+> [!NOTE] **[LeetCode 1562. 查找大小为 M 的最新分组](https://leetcode.cn/problems/find-latest-group-of-size-m/)**
 > 
 > 题意: 
 > 
@@ -498,7 +498,7 @@ public:
 
 ### 离线并查集
 
-> [!NOTE] **[LeetCode 1697. 检查边长度限制的路径是否存在](https://leetcode-cn.com/problems/checking-existence-of-edge-length-limited-paths/)** [TAG]
+> [!NOTE] **[LeetCode 1697. 检查边长度限制的路径是否存在](https://leetcode.cn/problems/checking-existence-of-edge-length-limited-paths/)** [TAG]
 > 
 > [Weekly-220](https://github.com/OpenKikCoc/LeetCode/tree/master/Contest/2020-12-20_Weekly-220)
 > 
@@ -704,7 +704,7 @@ public:
 
 ### 联通性质进阶: 线段染色 / 快速找右侧的一个
 
-> [!NOTE] **[LeetCode 1851. 包含每个查询的最小区间](https://leetcode-cn.com/problems/minimum-interval-to-include-each-query/)** [TAG]
+> [!NOTE] **[LeetCode 1851. 包含每个查询的最小区间](https://leetcode.cn/problems/minimum-interval-to-include-each-query/)** [TAG]
 > 
 > [weekly-239](https://github.com/OpenKikCoc/LeetCode/tree/master/Contest/2021-05-02_Weekly-239)
 > 
diff --git a/ds/dsu-extend.md b/ds/dsu-extend.md
index 348f5dd..f8a2e83 100644
--- a/ds/dsu-extend.md
+++ b/ds/dsu-extend.md
@@ -333,7 +333,7 @@ if __name__ == '__main__':
 
 * * *
 
-> [!NOTE] **[LeetCode 684. 冗余连接](https://leetcode-cn.com/problems/redundant-connection/)**
+> [!NOTE] **[LeetCode 684. 冗余连接](https://leetcode.cn/problems/redundant-connection/)**
 > 
 > 题意: TODO
 
@@ -384,7 +384,7 @@ public:
 * * *
 
 
-> [!NOTE] **[LeetCode 685. 冗余连接 II](https://leetcode-cn.com/problems/redundant-connection-ii/)**
+> [!NOTE] **[LeetCode 685. 冗余连接 II](https://leetcode.cn/problems/redundant-connection-ii/)**
 > 
 > 题意: TODO
 
@@ -536,7 +536,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1319. 连通网络的操作次数](https://leetcode-cn.com/problems/number-of-operations-to-make-network-connected/)**
+> [!NOTE] **[LeetCode 1319. 连通网络的操作次数](https://leetcode.cn/problems/number-of-operations-to-make-network-connected/)**
 > 
 > 题意: TODO
 
@@ -592,7 +592,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1627. 带阈值的图连通性](https://leetcode-cn.com/problems/graph-connectivity-with-threshold/)** [TAG]
+> [!NOTE] **[LeetCode 1627. 带阈值的图连通性](https://leetcode.cn/problems/graph-connectivity-with-threshold/)** [TAG]
 > 
 > 题意: TODO
 
@@ -845,7 +845,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 399. 除法求值](https://leetcode-cn.com/problems/evaluate-division/)**
+> [!NOTE] **[LeetCode 399. 除法求值](https://leetcode.cn/problems/evaluate-division/)**
 > 
 > 题意: TODO
 
@@ -1290,7 +1290,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 2076. 处理含限制条件的好友请求](https://leetcode-cn.com/problems/process-restricted-friend-requests/)** [TAG]
+> [!NOTE] **[LeetCode 2076. 处理含限制条件的好友请求](https://leetcode.cn/problems/process-restricted-friend-requests/)** [TAG]
 > 
 > 题意: 并非**反集**的一道题
 
@@ -1629,7 +1629,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1361. 验证二叉树](https://leetcode-cn.com/problems/validate-binary-tree-nodes/)**
+> [!NOTE] **[LeetCode 1361. 验证二叉树](https://leetcode.cn/problems/validate-binary-tree-nodes/)**
 > 
 > 题意:
 > 
@@ -1708,7 +1708,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1579. 保证图可完全遍历](https://leetcode-cn.com/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable/)** [TAG]
+> [!NOTE] **[LeetCode 1579. 保证图可完全遍历](https://leetcode.cn/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable/)** [TAG]
 > 
 > 题意: TODO
 
@@ -1779,7 +1779,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1970. 你能穿过矩阵的最后一天](https://leetcode-cn.com/problems/last-day-where-you-can-still-cross/)**
+> [!NOTE] **[LeetCode 1970. 你能穿过矩阵的最后一天](https://leetcode.cn/problems/last-day-where-you-can-still-cross/)**
 > 
 > 题意: TODO
 
@@ -2326,7 +2326,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1202. 交换字符串中的元素](https://leetcode-cn.com/problems/smallest-string-with-swaps/)** [TAG]
+> [!NOTE] **[LeetCode 1202. 交换字符串中的元素](https://leetcode.cn/problems/smallest-string-with-swaps/)** [TAG]
 > 
 > 题意: TODO
 
@@ -2385,7 +2385,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1722. 执行交换操作后的最小汉明距离](https://leetcode-cn.com/problems/minimize-hamming-distance-after-swap-operations/)**
+> [!NOTE] **[LeetCode 1722. 执行交换操作后的最小汉明距离](https://leetcode.cn/problems/minimize-hamming-distance-after-swap-operations/)**
 > 
 > 题意: TODO
 
@@ -2493,7 +2493,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1998. 数组的最大公因数排序](https://leetcode-cn.com/problems/gcd-sort-of-an-array/)**
+> [!NOTE] **[LeetCode 1998. 数组的最大公因数排序](https://leetcode.cn/problems/gcd-sort-of-an-array/)**
 > 
 > 题意: TODO
 
@@ -2594,7 +2594,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2157. 字符串分组](https://leetcode-cn.com/problems/groups-of-strings/)**
+> [!NOTE] **[LeetCode 2157. 字符串分组](https://leetcode.cn/problems/groups-of-strings/)**
 > 
 > 题意: TODO
 
diff --git a/ds/fenwick.md b/ds/fenwick.md
index 6be460e..e42226a 100644
--- a/ds/fenwick.md
+++ b/ds/fenwick.md
@@ -17,7 +17,7 @@
 >     }
 > ```
 >
-> 具体使用参见 [307. 区域和检索 - 数组可修改](https://leetcode-cn.com/problems/range-sum-query-mutable/)
+> 具体使用参见 [307. 区域和检索 - 数组可修改](https://leetcode.cn/problems/range-sum-query-mutable/)
 >
 > - 给所有的位置加 1
 >
@@ -851,7 +851,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 315. 计算右侧小于当前元素的个数](https://leetcode-cn.com/problems/count-of-smaller-numbers-after-self/)**
+> [!NOTE] **[LeetCode 315. 计算右侧小于当前元素的个数](https://leetcode.cn/problems/count-of-smaller-numbers-after-self/)**
 > 
 > 题意: TODO
 
@@ -908,7 +908,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 406. 根据身高重建队列](https://leetcode-cn.com/problems/queue-reconstruction-by-height/)**
+> [!NOTE] **[LeetCode 406. 根据身高重建队列](https://leetcode.cn/problems/queue-reconstruction-by-height/)**
 > 
 > 题意: TODO
 
@@ -1047,7 +1047,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1649. 通过指令创建有序数组](https://leetcode-cn.com/problems/create-sorted-array-through-instructions/)**
+> [!NOTE] **[LeetCode 1649. 通过指令创建有序数组](https://leetcode.cn/problems/create-sorted-array-through-instructions/)**
 > 
 > 题意: TODO
 
@@ -1132,7 +1132,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1845. 座位预约管理系统](https://leetcode-cn.com/problems/seat-reservation-manager/)**
+> [!NOTE] **[LeetCode 1845. 座位预约管理系统](https://leetcode.cn/problems/seat-reservation-manager/)**
 > 
 > 题意: TODO
 
@@ -1428,7 +1428,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 327. 区间和的个数](https://leetcode-cn.com/problems/count-of-range-sum/)**
+> [!NOTE] **[LeetCode 327. 区间和的个数](https://leetcode.cn/problems/count-of-range-sum/)**
 > 
 > 题意: TODO
 
@@ -1626,7 +1626,7 @@ public:
 
 ### 综合应用
 
-> [!NOTE] **[LeetCode 2179. 统计数组中好三元组数目](https://leetcode-cn.com/problems/count-good-triplets-in-an-array/)**
+> [!NOTE] **[LeetCode 2179. 统计数组中好三元组数目](https://leetcode.cn/problems/count-good-triplets-in-an-array/)**
 > 
 > 题意: TODO
 
@@ -1797,7 +1797,7 @@ int main() {
 
 ### 进阶应用
 
-> [!NOTE] **[LeetCode 1505. 最多 K 次交换相邻数位后得到的最小整数](https://leetcode-cn.com/problems/minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits/)** [TAG] 模版题
+> [!NOTE] **[LeetCode 1505. 最多 K 次交换相邻数位后得到的最小整数](https://leetcode.cn/problems/minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits/)** [TAG] 模版题
 > 
 > 题意: TODO
 
@@ -1810,7 +1810,7 @@ int main() {
 > 1.  贪心：把最靠前的数字`x` 改最小，此时的 `最小` 需满足与 `x `位置差小于剩余可移动步数。随后进行的操作：将 `x` 与 `最小` 数字间的所有数字右移。
 > 2.  线段树：动态维护异动区间 以及 查找区间最小值来和靠前数交换
 >
-> 更新模版 参考[liouzhou_101](https://leetcode-cn.com/u/liouzhou_101/)
+> 更新模版 参考[liouzhou_101](https://leetcode.cn/u/liouzhou_101/)
 > 
 > **重复做**
 
diff --git a/ds/heap.md b/ds/heap.md
index 0371507..56c8292 100644
--- a/ds/heap.md
+++ b/ds/heap.md
@@ -118,7 +118,7 @@ int main() {
 
 ### heap
 
-> [!NOTE] **[LeetCode 373. 查找和最小的K对数字](https://leetcode-cn.com/problems/find-k-pairs-with-smallest-sums/)**
+> [!NOTE] **[LeetCode 373. 查找和最小的K对数字](https://leetcode.cn/problems/find-k-pairs-with-smallest-sums/)**
 > 
 > 题意: TODO
 
@@ -189,7 +189,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 658. 找到 K 个最接近的元素](https://leetcode-cn.com/problems/find-k-closest-elements/)**
+> [!NOTE] **[LeetCode 658. 找到 K 个最接近的元素](https://leetcode.cn/problems/find-k-closest-elements/)**
 > 
 > 题意: TODO
 
@@ -233,7 +233,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 692. 前K个高频单词](https://leetcode-cn.com/problems/top-k-frequent-words/)**
+> [!NOTE] **[LeetCode 692. 前K个高频单词](https://leetcode.cn/problems/top-k-frequent-words/)**
 > 
 > 题意: 尝试以 $O(n log k)$ 时间复杂度和 $O(n)$ 空间复杂度解决。
 
@@ -303,7 +303,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1439. 有序矩阵中的第 k 个最小数组和](https://leetcode-cn.com/problems/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows/)** [TAG]
+> [!NOTE] **[LeetCode 1439. 有序矩阵中的第 k 个最小数组和](https://leetcode.cn/problems/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows/)** [TAG]
 > 
 > 题意: TODO
 
@@ -383,7 +383,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1801. 积压订单中的订单总数](https://leetcode-cn.com/problems/number-of-orders-in-the-backlog/)**
+> [!NOTE] **[LeetCode 1801. 积压订单中的订单总数](https://leetcode.cn/problems/number-of-orders-in-the-backlog/)**
 > 
 > 题意: TODO
 
@@ -467,7 +467,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1847. 最近的房间](https://leetcode-cn.com/problems/closest-room/)**
+> [!NOTE] **[LeetCode 1847. 最近的房间](https://leetcode.cn/problems/closest-room/)**
 > 
 > 题意: TODO
 
@@ -596,7 +596,7 @@ public:
 
 ### 双堆模拟 一般用于占用类问题
 
-> [!NOTE] **[LeetCode 1606. 找到处理最多请求的服务器](https://leetcode-cn.com/problems/find-servers-that-handled-most-number-of-requests/)** [TAG]
+> [!NOTE] **[LeetCode 1606. 找到处理最多请求的服务器](https://leetcode.cn/problems/find-servers-that-handled-most-number-of-requests/)** [TAG]
 > 
 > 题意: TODO
 
@@ -658,7 +658,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1882. 使用服务器处理任务](https://leetcode-cn.com/problems/process-tasks-using-servers/)**
+> [!NOTE] **[LeetCode 1882. 使用服务器处理任务](https://leetcode.cn/problems/process-tasks-using-servers/)**
 > 
 > 题意: TODO
 
@@ -884,7 +884,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1942. 最小未被占据椅子的编号](https://leetcode-cn.com/problems/the-number-of-the-smallest-unoccupied-chair/)**
+> [!NOTE] **[LeetCode 1942. 最小未被占据椅子的编号](https://leetcode.cn/problems/the-number-of-the-smallest-unoccupied-chair/)**
 > 
 > 题意: TODO
 
@@ -1202,7 +1202,7 @@ public:
 
 ### multiset
 
-> [!NOTE] **[LeetCode 218. 天际线问题](https://leetcode-cn.com/problems/the-skyline-problem/)**
+> [!NOTE] **[LeetCode 218. 天际线问题](https://leetcode.cn/problems/the-skyline-problem/)**
 > 
 > 题意: TODO
 
@@ -1259,7 +1259,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 480. 滑动窗口中位数](https://leetcode-cn.com/problems/sliding-window-median/)**
+> [!NOTE] **[LeetCode 480. 滑动窗口中位数](https://leetcode.cn/problems/sliding-window-median/)**
 > 
 > 题意: TODO
 
diff --git a/ds/huffman-tree.md b/ds/huffman-tree.md
index 52f3842..1734691 100644
--- a/ds/huffman-tree.md
+++ b/ds/huffman-tree.md
@@ -176,7 +176,7 @@ void huffmanCoding(Htree root, int len, int arr[]) {  // 计算霍夫曼编码
 
 ### 进阶 huffman 思想
 
-> [!NOTE] **[LeetCode 1199. 建造街区的最短时间](https://leetcode-cn.com/problems/minimum-time-to-build-blocks/)** [TAG]
+> [!NOTE] **[LeetCode 1199. 建造街区的最短时间](https://leetcode.cn/problems/minimum-time-to-build-blocks/)** [TAG]
 > 
 > 题意: TODO
 
diff --git a/ds/linked-list.md b/ds/linked-list.md
index cd2cb29..722d7c0 100644
--- a/ds/linked-list.md
+++ b/ds/linked-list.md
@@ -594,7 +594,7 @@ if __name__ == '__main__':
 
 ### 链表操作
 
-> [!NOTE] **[LeetCode 19. 删除链表的倒数第N个节点](https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/)**
+> [!NOTE] **[LeetCode 19. 删除链表的倒数第N个节点](https://leetcode.cn/problems/remove-nth-node-from-end-of-list/)**
 > 
 > 题意: TODO
 
@@ -663,7 +663,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 21. 合并两个有序链表](https://leetcode-cn.com/problems/merge-two-sorted-lists/)**
+> [!NOTE] **[LeetCode 21. 合并两个有序链表](https://leetcode.cn/problems/merge-two-sorted-lists/)**
 > 
 > 题意: TODO
 
@@ -733,7 +733,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 23. 合并K个升序链表](https://leetcode-cn.com/problems/merge-k-sorted-lists/)**
+> [!NOTE] **[LeetCode 23. 合并K个升序链表](https://leetcode.cn/problems/merge-k-sorted-lists/)**
 > 
 > 题意: TODO
 
@@ -854,7 +854,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 24. 两两交换链表中的节点](https://leetcode-cn.com/problems/swap-nodes-in-pairs/)**
+> [!NOTE] **[LeetCode 24. 两两交换链表中的节点](https://leetcode.cn/problems/swap-nodes-in-pairs/)**
 > 
 > 题意: TODO
 
@@ -954,7 +954,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 25. K 个一组翻转链表](https://leetcode-cn.com/problems/reverse-nodes-in-k-group/)**
+> [!NOTE] **[LeetCode 25. K 个一组翻转链表](https://leetcode.cn/problems/reverse-nodes-in-k-group/)**
 > 
 > 题意: TODO
 
@@ -1061,7 +1061,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 61. 旋转链表](https://leetcode-cn.com/problems/rotate-list/)**
+> [!NOTE] **[LeetCode 61. 旋转链表](https://leetcode.cn/problems/rotate-list/)**
 > 
 > 题意: TODO
 
@@ -1165,7 +1165,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 82. 删除排序链表中的重复元素 II](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list-ii/)**
+> [!NOTE] **[LeetCode 82. 删除排序链表中的重复元素 II](https://leetcode.cn/problems/remove-duplicates-from-sorted-list-ii/)**
 > 
 > 题意: TODO
 
@@ -1271,7 +1271,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 86. 分隔链表](https://leetcode-cn.com/problems/partition-list/)**
+> [!NOTE] **[LeetCode 86. 分隔链表](https://leetcode.cn/problems/partition-list/)**
 > 
 > 题意: TODO
 
@@ -1362,7 +1362,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 92. 反转链表 II](https://leetcode-cn.com/problems/reverse-linked-list-ii/)**
+> [!NOTE] **[LeetCode 92. 反转链表 II](https://leetcode.cn/problems/reverse-linked-list-ii/)**
 > 
 > 题意: TODO
 
@@ -1477,7 +1477,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 138. 复制带随机指针的链表](https://leetcode-cn.com/problems/copy-list-with-random-pointer/)**
+> [!NOTE] **[LeetCode 138. 复制带随机指针的链表](https://leetcode.cn/problems/copy-list-with-random-pointer/)**
 > 
 > 题意: TODO
 
@@ -1555,7 +1555,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 141. 环形链表](https://leetcode-cn.com/problems/linked-list-cycle/)**
+> [!NOTE] **[LeetCode 141. 环形链表](https://leetcode.cn/problems/linked-list-cycle/)**
 > 
 > 题意: TODO
 
@@ -1614,7 +1614,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 142. 环形链表 II](https://leetcode-cn.com/problems/linked-list-cycle-ii/)**
+> [!NOTE] **[LeetCode 142. 环形链表 II](https://leetcode.cn/problems/linked-list-cycle-ii/)**
 > 
 > 题意: TODO
 
@@ -1685,7 +1685,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 143. 重排链表](https://leetcode-cn.com/problems/reorder-list/)**
+> [!NOTE] **[LeetCode 143. 重排链表](https://leetcode.cn/problems/reorder-list/)**
 > 
 > 题意: TODO
 
@@ -1820,7 +1820,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 147. 对链表进行插入排序](https://leetcode-cn.com/problems/insertion-sort-list/)**
+> [!NOTE] **[LeetCode 147. 对链表进行插入排序](https://leetcode.cn/problems/insertion-sort-list/)**
 > 
 > 题意: TODO
 
@@ -1905,7 +1905,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 148. 排序链表](https://leetcode-cn.com/problems/sort-list/)**
+> [!NOTE] **[LeetCode 148. 排序链表](https://leetcode.cn/problems/sort-list/)**
 > 
 > 题意: TODO
 
@@ -2059,7 +2059,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 160. 相交链表](https://leetcode-cn.com/problems/intersection-of-two-linked-lists/)**
+> [!NOTE] **[LeetCode 160. 相交链表](https://leetcode.cn/problems/intersection-of-two-linked-lists/)**
 > 
 > 题意: TODO
 
@@ -2108,7 +2108,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 203. 移除链表元素](https://leetcode-cn.com/problems/remove-linked-list-elements/)**
+> [!NOTE] **[LeetCode 203. 移除链表元素](https://leetcode.cn/problems/remove-linked-list-elements/)**
 > 
 > 题意: TODO
 
@@ -2189,7 +2189,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 206. 反转链表](https://leetcode-cn.com/problems/reverse-linked-list/)**
+> [!NOTE] **[LeetCode 206. 反转链表](https://leetcode.cn/problems/reverse-linked-list/)**
 > 
 > 题意: TODO
 
@@ -2304,7 +2304,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 234. 回文链表](https://leetcode-cn.com/problems/palindrome-linked-list/)**
+> [!NOTE] **[LeetCode 234. 回文链表](https://leetcode.cn/problems/palindrome-linked-list/)**
 > 
 > 题意: TODO
 
@@ -2432,7 +2432,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 237. 删除链表中的节点](https://leetcode-cn.com/problems/delete-node-in-a-linked-list/)**
+> [!NOTE] **[LeetCode 237. 删除链表中的节点](https://leetcode.cn/problems/delete-node-in-a-linked-list/)**
 > 
 > 题意: TODO
 
@@ -2484,7 +2484,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 328. 奇偶链表](https://leetcode-cn.com/problems/odd-even-linked-list/)**
+> [!NOTE] **[LeetCode 328. 奇偶链表](https://leetcode.cn/problems/odd-even-linked-list/)**
 > 
 > 题意: TODO
 
@@ -2555,7 +2555,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 725. 分隔链表](https://leetcode-cn.com/problems/split-linked-list-in-parts/)**
+> [!NOTE] **[LeetCode 725. 分隔链表](https://leetcode.cn/problems/split-linked-list-in-parts/)**
 > 
 > 题意: TODO
 
@@ -2615,7 +2615,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1171. 从链表中删去总和值为零的连续节点](https://leetcode-cn.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list/)**
+> [!NOTE] **[LeetCode 1171. 从链表中删去总和值为零的连续节点](https://leetcode.cn/problems/remove-zero-sum-consecutive-nodes-from-linked-list/)**
 > 
 > 题意: TODO
 
@@ -2710,7 +2710,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2095. 删除链表的中间节点](https://leetcode-cn.com/problems/delete-the-middle-node-of-a-linked-list/)**
+> [!NOTE] **[LeetCode 2095. 删除链表的中间节点](https://leetcode.cn/problems/delete-the-middle-node-of-a-linked-list/)**
 > 
 > 题意: TODO
 
@@ -2846,7 +2846,7 @@ public:
 
 ### 结合递归
 
-> [!NOTE] **[LeetCode 430. 扁平化多级双向链表](https://leetcode-cn.com/problems/flatten-a-multilevel-doubly-linked-list/)**
+> [!NOTE] **[LeetCode 430. 扁平化多级双向链表](https://leetcode.cn/problems/flatten-a-multilevel-doubly-linked-list/)**
 > 
 > 题意: TODO
 
diff --git a/ds/monotonous-queue.md b/ds/monotonous-queue.md
index 3eff6f9..9fa8cb9 100644
--- a/ds/monotonous-queue.md
+++ b/ds/monotonous-queue.md
@@ -233,7 +233,7 @@ if __name__ == '__main__':
 
 * * *
 
-> [!NOTE] **[LeetCode 1499. 满足不等式的最大值](https://leetcode-cn.com/problems/max-value-of-equation/)**
+> [!NOTE] **[LeetCode 1499. 满足不等式的最大值](https://leetcode.cn/problems/max-value-of-equation/)**
 > 
 > 题意: TODO
 
@@ -307,7 +307,7 @@ public:
 
 ### 结合前后缀分解
 
-> [!NOTE] **[LeetCode 1888. 使二进制字符串字符交替的最少反转次数](https://leetcode-cn.com/problems/minimum-number-of-flips-to-make-the-binary-string-alternating/)**
+> [!NOTE] **[LeetCode 1888. 使二进制字符串字符交替的最少反转次数](https://leetcode.cn/problems/minimum-number-of-flips-to-make-the-binary-string-alternating/)**
 > 
 > [weekly-244](https://github.com/OpenKikCoc/LeetCode/tree/master/Contest/2021-06-06_Weekly-244) 详细看左侧链接
 > 
diff --git a/ds/monotonous-stack.md b/ds/monotonous-stack.md
index 1af69bf..d52eed8 100644
--- a/ds/monotonous-stack.md
+++ b/ds/monotonous-stack.md
@@ -200,7 +200,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1944. 队列中可以看到的人数](https://leetcode-cn.com/problems/number-of-visible-people-in-a-queue/)**
+> [!NOTE] **[LeetCode 1944. 队列中可以看到的人数](https://leetcode.cn/problems/number-of-visible-people-in-a-queue/)**
 > 
 > [biweekly-57](https://github.com/OpenKikCoc/LeetCode/tree/master/Contest/2021-07-24_Biweekly-57/)
 > 
@@ -283,7 +283,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 496. 下一个更大元素 I](https://leetcode-cn.com/problems/next-greater-element-i/)**
+> [!NOTE] **[LeetCode 496. 下一个更大元素 I](https://leetcode.cn/problems/next-greater-element-i/)**
 > 
 > 题意: TODO
 
@@ -376,7 +376,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 503. 下一个更大元素 II](https://leetcode-cn.com/problems/next-greater-element-ii/)**
+> [!NOTE] **[LeetCode 503. 下一个更大元素 II](https://leetcode.cn/problems/next-greater-element-ii/)**
 > 
 > 题意: TODO
 
@@ -491,7 +491,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 556. 下一个更大元素 III](https://leetcode-cn.com/problems/next-greater-element-iii/)**
+> [!NOTE] **[LeetCode 556. 下一个更大元素 III](https://leetcode.cn/problems/next-greater-element-iii/)**
 > 
 > 题意: TODO
 
@@ -537,7 +537,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 735. 行星碰撞](https://leetcode-cn.com/problems/asteroid-collision/)**
+> [!NOTE] **[LeetCode 735. 行星碰撞](https://leetcode.cn/problems/asteroid-collision/)**
 > 
 > 题意: TODO
 
@@ -732,7 +732,7 @@ public:
 
 ### 进阶（推导）
 
-> [!NOTE] **[LeetCode 42. 接雨水](https://leetcode-cn.com/problems/trapping-rain-water/)**
+> [!NOTE] **[LeetCode 42. 接雨水](https://leetcode.cn/problems/trapping-rain-water/)**
 > 
 > 题意: TODO
 
@@ -873,7 +873,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 84. 柱状图中最大的矩形](https://leetcode-cn.com/problems/largest-rectangle-in-histogram/)**
+> [!NOTE] **[LeetCode 84. 柱状图中最大的矩形](https://leetcode.cn/problems/largest-rectangle-in-histogram/)**
 > 
 > 题意: TODO
 
@@ -1022,7 +1022,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 85. 最大矩形](https://leetcode-cn.com/problems/maximal-rectangle/)**
+> [!NOTE] **[LeetCode 85. 最大矩形](https://leetcode.cn/problems/maximal-rectangle/)**
 > 
 > 题意: TODO
 
@@ -1188,7 +1188,7 @@ int main() {
 * * *
 
 
-> [!NOTE] **[LeetCode 1944. 队列中可以看到的人数](https://leetcode-cn.com/problems/number-of-visible-people-in-a-queue/)**
+> [!NOTE] **[LeetCode 1944. 队列中可以看到的人数](https://leetcode.cn/problems/number-of-visible-people-in-a-queue/)**
 > 
 > 题意: TODO
 
@@ -1566,7 +1566,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 316. 去除重复字母](https://leetcode-cn.com/problems/remove-duplicate-letters/)**
+> [!NOTE] **[LeetCode 316. 去除重复字母](https://leetcode.cn/problems/remove-duplicate-letters/)**
 > 
 > 题意: TODO
 
@@ -1637,7 +1637,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2030. 含特定字母的最小子序列](https://leetcode-cn.com/problems/smallest-k-length-subsequence-with-occurrences-of-a-letter/)**
+> [!NOTE] **[LeetCode 2030. 含特定字母的最小子序列](https://leetcode.cn/problems/smallest-k-length-subsequence-with-occurrences-of-a-letter/)**
 > 
 > [weekly-261](https://github.com/OpenKikCoc/LeetCode/blob/master/Contest/2021-10-03_Weekly-261/)
 > 
@@ -1718,7 +1718,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 321. 拼接最大数](https://leetcode-cn.com/problems/create-maximum-number/)**
+> [!NOTE] **[LeetCode 321. 拼接最大数](https://leetcode.cn/problems/create-maximum-number/)**
 > 
 > 题意: TODO
 
@@ -1819,7 +1819,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 402. 移掉K位数字](https://leetcode-cn.com/problems/remove-k-digits/)**
+> [!NOTE] **[LeetCode 402. 移掉K位数字](https://leetcode.cn/problems/remove-k-digits/)**
 > 
 > 题意: TODO
 
@@ -1948,7 +1948,7 @@ class Solution(object):
 
 * * *
 
-> [!NOTE] **[LeetCode 1673. 找出最具竞争力的子序列](https://leetcode-cn.com/problems/find-the-most-competitive-subsequence/)**
+> [!NOTE] **[LeetCode 1673. 找出最具竞争力的子序列](https://leetcode.cn/problems/find-the-most-competitive-subsequence/)**
 > 
 > 题意: TODO
 
@@ -1999,7 +1999,7 @@ public:
 
 ### 132 模式
 
-> [!NOTE] **[LeetCode 456. 132模式](https://leetcode-cn.com/problems/132-pattern/)**
+> [!NOTE] **[LeetCode 456. 132模式](https://leetcode.cn/problems/132-pattern/)**
 > 
 > 题意: TODO
 
diff --git a/ds/odt.md b/ds/odt.md
index ee706c4..f14083c 100644
--- a/ds/odt.md
+++ b/ds/odt.md
@@ -193,7 +193,7 @@ void performance(int l, int r) {
 - [「Luogu 2787」理理思维](https://www.luogu.com.cn/problem/P2787)
 - [「Luogu 4979」矿洞：坍塌](https://www.luogu.com.cn/problem/P4979)
 
-> [!NOTE] **[LeetCode 715. Range 模块](https://leetcode-cn.com/problems/range-module/)**
+> [!NOTE] **[LeetCode 715. Range 模块](https://leetcode.cn/problems/range-module/)**
 > 
 > 题意: TODO
 
@@ -403,7 +403,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2213. 由单个字符重复的最长子字符串](https://leetcode-cn.com/problems/longest-substring-of-one-repeating-character/)** [TAG]
+> [!NOTE] **[LeetCode 2213. 由单个字符重复的最长子字符串](https://leetcode.cn/problems/longest-substring-of-one-repeating-character/)** [TAG]
 > 
 > 题意: TODO
 
diff --git a/ds/persistent-seg.md b/ds/persistent-seg.md
index 31cd5e1..eda93da 100644
--- a/ds/persistent-seg.md
+++ b/ds/persistent-seg.md
@@ -251,7 +251,7 @@ int main() {
 
 ## 习题
 
-> [!NOTE] **[LeetCode 1157. 子数组中占绝大多数的元素](https://leetcode-cn.com/problems/online-majority-element-in-subarray/)** [TAG]
+> [!NOTE] **[LeetCode 1157. 子数组中占绝大多数的元素](https://leetcode.cn/problems/online-majority-element-in-subarray/)** [TAG]
 > 
 > 题意: TODO
 
diff --git a/ds/seg.md b/ds/seg.md
index 58b4b83..68bc0f6 100644
--- a/ds/seg.md
+++ b/ds/seg.md
@@ -1598,7 +1598,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 699. 掉落的方块](https://leetcode-cn.com/problems/falling-squares/)**
+> [!NOTE] **[LeetCode 699. 掉落的方块](https://leetcode.cn/problems/falling-squares/)**
 > 
 > 题意: TODO
 
@@ -2526,7 +2526,7 @@ int main() {
 
 ### 进阶应用
 
-> [!NOTE] **[LeetCode 1505. 最多 K 次交换相邻数位后得到的最小整数](https://leetcode-cn.com/problems/minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits/)** [TAG] 模版题
+> [!NOTE] **[LeetCode 1505. 最多 K 次交换相邻数位后得到的最小整数](https://leetcode.cn/problems/minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits/)** [TAG] 模版题
 > 
 > 题意: TODO
 
@@ -2537,7 +2537,7 @@ int main() {
 > 1.  贪心：把最靠前的数字`x` 改最小，此时的 `最小` 需满足与 `x `位置差小于剩余可移动步数。随后进行的操作：将 `x` 与 `最小` 数字间的所有数字右移。
 > 2.  线段树：动态维护异动区间 以及 查找区间最小值来和靠前数交换
 >
-> 更新模版 参考[liouzhou_101](https://leetcode-cn.com/u/liouzhou_101/)
+> 更新模版 参考[liouzhou_101](https://leetcode.cn/u/liouzhou_101/)
 > 
 > **重复做**
 
diff --git a/ds/sliding-window.md b/ds/sliding-window.md
index 32ae5c1..467450f 100644
--- a/ds/sliding-window.md
+++ b/ds/sliding-window.md
@@ -2,7 +2,7 @@
 
 ## 一般应用
 
-> [!NOTE] **[LeetCode 30. 串联所有单词的子串](https://leetcode-cn.com/problems/substring-with-concatenation-of-all-words/)**
+> [!NOTE] **[LeetCode 30. 串联所有单词的子串](https://leetcode.cn/problems/substring-with-concatenation-of-all-words/)**
 > 
 > 题意: TODO
 
@@ -99,7 +99,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 76. 最小覆盖子串](https://leetcode-cn.com/problems/minimum-window-substring/)**
+> [!NOTE] **[LeetCode 76. 最小覆盖子串](https://leetcode.cn/problems/minimum-window-substring/)**
 > 
 > 题意: TODO
 
@@ -181,7 +181,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 209. 长度最小的子数组](https://leetcode-cn.com/problems/minimum-size-subarray-sum/)**
+> [!NOTE] **[LeetCode 209. 长度最小的子数组](https://leetcode.cn/problems/minimum-size-subarray-sum/)**
 > 
 > 题意: TODO
 
@@ -247,7 +247,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 220. 存在重复元素 III](https://leetcode-cn.com/problems/contains-duplicate-iii/)**
+> [!NOTE] **[LeetCode 220. 存在重复元素 III](https://leetcode.cn/problems/contains-duplicate-iii/)**
 > 
 > 题意: TODO
 
@@ -309,7 +309,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 239. 滑动窗口最大值](https://leetcode-cn.com/problems/sliding-window-maximum/)**
+> [!NOTE] **[LeetCode 239. 滑动窗口最大值](https://leetcode.cn/problems/sliding-window-maximum/)**
 > 
 > 题意: TODO
 
@@ -367,7 +367,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 395. 至少有K个重复字符的最长子串](https://leetcode-cn.com/problems/longest-substring-with-at-least-k-repeating-characters/)**
+> [!NOTE] **[LeetCode 395. 至少有K个重复字符的最长子串](https://leetcode.cn/problems/longest-substring-with-at-least-k-repeating-characters/)**
 > 
 > 题意: TODO
 
@@ -456,7 +456,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 424. 替换后的最长重复字符](https://leetcode-cn.com/problems/longest-repeating-character-replacement/)**
+> [!NOTE] **[LeetCode 424. 替换后的最长重复字符](https://leetcode.cn/problems/longest-repeating-character-replacement/)**
 > 
 > 题意: TODO
 
@@ -523,7 +523,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 438. 找到字符串中所有字母异位词](https://leetcode-cn.com/problems/find-all-anagrams-in-a-string/)**
+> [!NOTE] **[LeetCode 438. 找到字符串中所有字母异位词](https://leetcode.cn/problems/find-all-anagrams-in-a-string/)**
 > 
 > 题意: TODO
 
@@ -630,7 +630,7 @@ class Solution(object):
 
 * * *
 
-> [!NOTE] **[LeetCode 567. 字符串的排列](https://leetcode-cn.com/problems/permutation-in-string/)**
+> [!NOTE] **[LeetCode 567. 字符串的排列](https://leetcode.cn/problems/permutation-in-string/)**
 > 
 > 题意: TODO
 
@@ -717,7 +717,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 643. 子数组最大平均数 I](https://leetcode-cn.com/problems/maximum-average-subarray-i/)**
+> [!NOTE] **[LeetCode 643. 子数组最大平均数 I](https://leetcode.cn/problems/maximum-average-subarray-i/)**
 > 
 > 题意: TODO
 
@@ -770,7 +770,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1151. 最少交换次数来组合所有的 1](https://leetcode-cn.com/problems/minimum-swaps-to-group-all-1s-together/)**
+> [!NOTE] **[LeetCode 1151. 最少交换次数来组合所有的 1](https://leetcode.cn/problems/minimum-swaps-to-group-all-1s-together/)**
 > 
 > 题意: TODO
 
@@ -818,7 +818,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1176. 健身计划评估](https://leetcode-cn.com/problems/diet-plan-performance/)**
+> [!NOTE] **[LeetCode 1176. 健身计划评估](https://leetcode.cn/problems/diet-plan-performance/)**
 > 
 > 题意: TODO
 
@@ -873,7 +873,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1208. 尽可能使字符串相等](https://leetcode-cn.com/problems/get-equal-substrings-within-budget/)**
+> [!NOTE] **[LeetCode 1208. 尽可能使字符串相等](https://leetcode.cn/problems/get-equal-substrings-within-budget/)**
 > 
 > 题意: TODO
 
@@ -943,7 +943,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1425. 带限制的子序列和](https://leetcode-cn.com/problems/constrained-subsequence-sum/)**
+> [!NOTE] **[LeetCode 1425. 带限制的子序列和](https://leetcode.cn/problems/constrained-subsequence-sum/)**
 > 
 > 题意: TODO
 
@@ -1000,7 +1000,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1438. 绝对差不超过限制的最长连续子数组](https://leetcode-cn.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/)** [TAG]
+> [!NOTE] **[LeetCode 1438. 绝对差不超过限制的最长连续子数组](https://leetcode.cn/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/)** [TAG]
 > 
 > 题意: TODO
 
@@ -1050,7 +1050,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1477. 找两个和为目标值且不重叠的子数组](https://leetcode-cn.com/problems/find-two-non-overlapping-sub-arrays-each-with-target-sum/)**
+> [!NOTE] **[LeetCode 1477. 找两个和为目标值且不重叠的子数组](https://leetcode.cn/problems/find-two-non-overlapping-sub-arrays-each-with-target-sum/)**
 > 
 > 题意: TODO
 
@@ -1105,7 +1105,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1695. 删除子数组的最大得分](https://leetcode-cn.com/problems/maximum-erasure-value/)**
+> [!NOTE] **[LeetCode 1695. 删除子数组的最大得分](https://leetcode.cn/problems/maximum-erasure-value/)**
 > 
 > 题意: TODO
 
@@ -1181,7 +1181,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2106. 摘水果](https://leetcode-cn.com/problems/maximum-fruits-harvested-after-at-most-k-steps/)** [TAG]
+> [!NOTE] **[LeetCode 2106. 摘水果](https://leetcode.cn/problems/maximum-fruits-harvested-after-at-most-k-steps/)** [TAG]
 > 
 > 题意: TODO
 
diff --git a/ds/stack.md b/ds/stack.md
index cf1d7bd..4fe7c1f 100644
--- a/ds/stack.md
+++ b/ds/stack.md
@@ -181,7 +181,7 @@ stk.clear()
 
 ### 弹出匹配
 
-> [!NOTE] **[LeetCode 20. 有效的括号](https://leetcode-cn.com/problems/valid-parentheses/)**
+> [!NOTE] **[LeetCode 20. 有效的括号](https://leetcode.cn/problems/valid-parentheses/)**
 > 
 > 题意: TODO
 
@@ -265,7 +265,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 591. 标签验证器](https://leetcode-cn.com/problems/tag-validator/)**
+> [!NOTE] **[LeetCode 591. 标签验证器](https://leetcode.cn/problems/tag-validator/)**
 > 
 > 题意: TODO
 
@@ -338,7 +338,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1249. 移除无效的括号](https://leetcode-cn.com/problems/minimum-remove-to-make-valid-parentheses/)**
+> [!NOTE] **[LeetCode 1249. 移除无效的括号](https://leetcode.cn/problems/minimum-remove-to-make-valid-parentheses/)**
 > 
 > 题意: TODO
 
@@ -392,7 +392,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1541. 平衡括号字符串的最少插入次数](https://leetcode-cn.com/problems/minimum-insertions-to-balance-a-parentheses-string/)** [TAG]
+> [!NOTE] **[LeetCode 1541. 平衡括号字符串的最少插入次数](https://leetcode.cn/problems/minimum-insertions-to-balance-a-parentheses-string/)** [TAG]
 > 
 > 题意: TODO
 
@@ -619,7 +619,7 @@ public:
 
 ### 栈维护
 
-> [!NOTE] **[LeetCode 636. 函数的独占时间](https://leetcode-cn.com/problems/exclusive-time-of-functions/)**
+> [!NOTE] **[LeetCode 636. 函数的独占时间](https://leetcode.cn/problems/exclusive-time-of-functions/)**
 > 
 > 题意: TODO
 
@@ -818,7 +818,7 @@ public:
 
 ### 其他操作
 
-> [!NOTE] **[LeetCode 1190. 反转每对括号间的子串](https://leetcode-cn.com/problems/reverse-substrings-between-each-pair-of-parentheses/)** [TAG]
+> [!NOTE] **[LeetCode 1190. 反转每对括号间的子串](https://leetcode.cn/problems/reverse-substrings-between-each-pair-of-parentheses/)** [TAG]
 > 
 > 题意: TODO
 
@@ -887,7 +887,7 @@ public:
 
 ### trick
 
-> [!NOTE] **[LeetCode 2197. 替换数组中的非互质数](https://leetcode-cn.com/problems/replace-non-coprime-numbers-in-array/)** [TAG]
+> [!NOTE] **[LeetCode 2197. 替换数组中的非互质数](https://leetcode.cn/problems/replace-non-coprime-numbers-in-array/)** [TAG]
 > 
 > 题意: TODO
 
diff --git a/geometry/2d.md b/geometry/2d.md
index 1e03c28..8129965 100644
--- a/geometry/2d.md
+++ b/geometry/2d.md
@@ -444,7 +444,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1401. 圆和矩形是否有重叠](https://leetcode-cn.com/problems/circle-and-rectangle-overlapping/)** [TAG]
+> [!NOTE] **[LeetCode 1401. 圆和矩形是否有重叠](https://leetcode.cn/problems/circle-and-rectangle-overlapping/)** [TAG]
 > 
 > 题意: TODO
 
@@ -506,7 +506,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1453. 圆形靶内的最大飞镖数量](https://leetcode-cn.com/problems/maximum-number-of-darts-inside-of-a-circular-dartboard/)** [TAG]
+> [!NOTE] **[LeetCode 1453. 圆形靶内的最大飞镖数量](https://leetcode.cn/problems/maximum-number-of-darts-inside-of-a-circular-dartboard/)** [TAG]
 > 
 > 题意: 
 > 
diff --git a/geometry/convex-hull.md b/geometry/convex-hull.md
index b27ae07..e53f30d 100644
--- a/geometry/convex-hull.md
+++ b/geometry/convex-hull.md
@@ -218,7 +218,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 587. 安装栅栏](https://leetcode-cn.com/problems/erect-the-fence/)**
+> [!NOTE] **[LeetCode 587. 安装栅栏](https://leetcode.cn/problems/erect-the-fence/)**
 > 
 > 题意: TODO
 
diff --git a/graph/bfs.md b/graph/bfs.md
index 06032c0..840cb7c 100644
--- a/graph/bfs.md
+++ b/graph/bfs.md
@@ -294,7 +294,7 @@ if __name__ == '__main__':
 
 * * *
 
-> [!NOTE] **[LeetCode 1210. 穿过迷宫的最少移动次数](https://leetcode-cn.com/problems/minimum-moves-to-reach-target-with-rotations/)**
+> [!NOTE] **[LeetCode 1210. 穿过迷宫的最少移动次数](https://leetcode.cn/problems/minimum-moves-to-reach-target-with-rotations/)**
 > 
 > 题意: TODO
 
@@ -360,7 +360,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1926. 迷宫中离入口最近的出口](https://leetcode-cn.com/problems/nearest-exit-from-entrance-in-maze/)**
+> [!NOTE] **[LeetCode 1926. 迷宫中离入口最近的出口](https://leetcode.cn/problems/nearest-exit-from-entrance-in-maze/)**
 > 
 > 题意: TODO
 
@@ -573,7 +573,7 @@ public:
 
 ### trick bfs
 
-> [!NOTE] **[LeetCode 675. 为高尔夫比赛砍树](https://leetcode-cn.com/problems/cut-off-trees-for-golf-event/)**
+> [!NOTE] **[LeetCode 675. 为高尔夫比赛砍树](https://leetcode.cn/problems/cut-off-trees-for-golf-event/)**
 > 
 > 题意: TODO
 
@@ -656,7 +656,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1263. 推箱子](https://leetcode-cn.com/problems/minimum-moves-to-move-a-box-to-their-target-location/)** [TAG]
+> [!NOTE] **[LeetCode 1263. 推箱子](https://leetcode.cn/problems/minimum-moves-to-move-a-box-to-their-target-location/)** [TAG]
 > 
 > 题意: TODO
 
@@ -744,7 +744,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1293. 网格中的最短路径](https://leetcode-cn.com/problems/shortest-path-in-a-grid-with-obstacles-elimination/)** [TAG]
+> [!NOTE] **[LeetCode 1293. 网格中的最短路径](https://leetcode.cn/problems/shortest-path-in-a-grid-with-obstacles-elimination/)** [TAG]
 > 
 > 题意: TODO
 
@@ -816,7 +816,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1298. 你能从盒子里获得的最大糖果数](https://leetcode-cn.com/problems/maximum-candies-you-can-get-from-boxes/)** [TAG]
+> [!NOTE] **[LeetCode 1298. 你能从盒子里获得的最大糖果数](https://leetcode.cn/problems/maximum-candies-you-can-get-from-boxes/)** [TAG]
 > 
 > 题意: TODO
 
@@ -890,7 +890,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2092. 找出知晓秘密的所有专家](https://leetcode-cn.com/problems/find-all-people-with-secret/)**
+> [!NOTE] **[LeetCode 2092. 找出知晓秘密的所有专家](https://leetcode.cn/problems/find-all-people-with-secret/)**
 > 
 > 题意: TODO
 
@@ -1053,7 +1053,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1466. 重新规划路线](https://leetcode-cn.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/)**
+> [!NOTE] **[LeetCode 1466. 重新规划路线](https://leetcode.cn/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/)**
 > 
 > 题意: TODO
 
@@ -1313,7 +1313,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1368. 使网格图至少有一条有效路径的最小代价](https://leetcode-cn.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid/)** [TAG]
+> [!NOTE] **[LeetCode 1368. 使网格图至少有一条有效路径的最小代价](https://leetcode.cn/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid/)** [TAG]
 > 
 > 题意: TODO
 
@@ -1375,7 +1375,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode LCP 56. 信物传送](https://leetcode-cn.com/problems/6UEx57/)**
+> [!NOTE] **[LeetCode LCP 56. 信物传送](https://leetcode.cn/problems/6UEx57/)**
 > 
 > 题意: TODO
 
diff --git a/graph/bi-graph.md b/graph/bi-graph.md
index ac66a7b..637af76 100644
--- a/graph/bi-graph.md
+++ b/graph/bi-graph.md
@@ -406,7 +406,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 785. 判断二分图](https://leetcode-cn.com/problems/is-graph-bipartite/)**
+> [!NOTE] **[LeetCode 785. 判断二分图](https://leetcode.cn/problems/is-graph-bipartite/)**
 > 
 > 题意: TODO
 
diff --git a/graph/concept.md b/graph/concept.md
index 461fa6e..a038b4d 100644
--- a/graph/concept.md
+++ b/graph/concept.md
@@ -478,7 +478,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 2127. 参加会议的最多员工数](https://leetcode-cn.com/problems/maximum-employees-to-be-invited-to-a-meeting/)** [TAG]
+> [!NOTE] **[LeetCode 2127. 参加会议的最多员工数](https://leetcode.cn/problems/maximum-employees-to-be-invited-to-a-meeting/)** [TAG]
 > 
 > 题意: TODO
 
diff --git a/graph/cut.md b/graph/cut.md
index 09f6576..cb50aa9 100644
--- a/graph/cut.md
+++ b/graph/cut.md
@@ -239,7 +239,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1192. 查找集群内的「关键连接」](https://leetcode-cn.com/problems/critical-connections-in-a-network/)**
+> [!NOTE] **[LeetCode 1192. 查找集群内的「关键连接」](https://leetcode.cn/problems/critical-connections-in-a-network/)**
 > 
 > 题意: TODO
 
diff --git a/graph/dfs.md b/graph/dfs.md
index 0eb9786..a73da9c 100644
--- a/graph/dfs.md
+++ b/graph/dfs.md
@@ -600,7 +600,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 133. 克隆图](https://leetcode-cn.com/problems/clone-graph/)**
+> [!NOTE] **[LeetCode 133. 克隆图](https://leetcode.cn/problems/clone-graph/)**
 > 
 > 题意: TODO
 
@@ -703,7 +703,7 @@ class Solution:
 
 ### 遍历问题
 
-> [!NOTE] **[LeetCode 130. 被围绕的区域](https://leetcode-cn.com/problems/surrounded-regions/)**
+> [!NOTE] **[LeetCode 130. 被围绕的区域](https://leetcode.cn/problems/surrounded-regions/)**
 > 
 > 题意: TODO
 
@@ -804,7 +804,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 200. 岛屿数量](https://leetcode-cn.com/problems/number-of-islands/)**
+> [!NOTE] **[LeetCode 200. 岛屿数量](https://leetcode.cn/problems/number-of-islands/)**
 > 
 > 题意: TODO
 
@@ -883,7 +883,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 417. 太平洋大西洋水流问题](https://leetcode-cn.com/problems/pacific-atlantic-water-flow/)**
+> [!NOTE] **[LeetCode 417. 太平洋大西洋水流问题](https://leetcode.cn/problems/pacific-atlantic-water-flow/)**
 > 
 > 题意: TODO
 
@@ -1013,7 +1013,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 463. 岛屿的周长](https://leetcode-cn.com/problems/island-perimeter/)**
+> [!NOTE] **[LeetCode 463. 岛屿的周长](https://leetcode.cn/problems/island-perimeter/)**
 > 
 > 题意: TODO
 
@@ -1114,7 +1114,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 542. 01 矩阵](https://leetcode-cn.com/problems/01-matrix/)**
+> [!NOTE] **[LeetCode 542. 01 矩阵](https://leetcode.cn/problems/01-matrix/)**
 > 
 > 题意: TODO
 
@@ -1170,7 +1170,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1254. 统计封闭岛屿的数目](https://leetcode-cn.com/problems/number-of-closed-islands/)**
+> [!NOTE] **[LeetCode 1254. 统计封闭岛屿的数目](https://leetcode.cn/problems/number-of-closed-islands/)**
 > 
 > 题意: TODO
 
@@ -1264,7 +1264,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1559. 二维网格图中探测环](https://leetcode-cn.com/problems/detect-cycles-in-2d-grid/)** [TAG]
+> [!NOTE] **[LeetCode 1559. 二维网格图中探测环](https://leetcode.cn/problems/detect-cycles-in-2d-grid/)** [TAG]
 > 
 > 题意: TODO
 
@@ -1329,7 +1329,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1905. 统计子岛屿](https://leetcode-cn.com/problems/count-sub-islands/)**
+> [!NOTE] **[LeetCode 1905. 统计子岛屿](https://leetcode.cn/problems/count-sub-islands/)**
 > 
 > 题意: TODO
 
@@ -1578,7 +1578,7 @@ public:
 
 ### 进阶
 
-> [!NOTE] **[LeetCode 749. 隔离病毒](https://leetcode-cn.com/problems/contain-virus/)**
+> [!NOTE] **[LeetCode 749. 隔离病毒](https://leetcode.cn/problems/contain-virus/)**
 > 
 > 题意: TODO
 
@@ -1683,7 +1683,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1568. 使陆地分离的最少天数](https://leetcode-cn.com/problems/minimum-number-of-days-to-disconnect-island/)** [TAG]
+> [!NOTE] **[LeetCode 1568. 使陆地分离的最少天数](https://leetcode.cn/problems/minimum-number-of-days-to-disconnect-island/)** [TAG]
 > 
 > 题意: TODO
 
diff --git a/graph/dsu-on-tree.md b/graph/dsu-on-tree.md
index aad0aa0..8e7bb68 100644
--- a/graph/dsu-on-tree.md
+++ b/graph/dsu-on-tree.md
@@ -199,7 +199,7 @@ int main() {
 
 ## 习题
 
-> [!NOTE] **[LeetCode 2003. 每棵子树内缺失的最小基因值](https://leetcode-cn.com/problems/smallest-missing-genetic-value-in-each-subtree/)** [TAG]
+> [!NOTE] **[LeetCode 2003. 每棵子树内缺失的最小基因值](https://leetcode.cn/problems/smallest-missing-genetic-value-in-each-subtree/)** [TAG]
 > 
 > 题意: TODO
 
diff --git a/graph/euler.md b/graph/euler.md
index 39ecdde..18804ae 100644
--- a/graph/euler.md
+++ b/graph/euler.md
@@ -150,7 +150,7 @@ $E = \{a_{j_1}a_{j_2}\cdots a_{j_{n-1}}|a_j \in S, 1 \leq j \leq n\}$
 
 ### 一般欧拉
 
-> [!NOTE] **[LeetCode 2097. 合法重新排列数对](https://leetcode-cn.com/problems/valid-arrangement-of-pairs/)** [TAG]
+> [!NOTE] **[LeetCode 2097. 合法重新排列数对](https://leetcode.cn/problems/valid-arrangement-of-pairs/)** [TAG]
 > 
 > 题意: TODO
 
@@ -567,7 +567,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 332. 重新安排行程](https://leetcode-cn.com/problems/reconstruct-itinerary/)**
+> [!NOTE] **[LeetCode 332. 重新安排行程](https://leetcode.cn/problems/reconstruct-itinerary/)**
 > 
 > 题意: TODO
 
@@ -721,7 +721,7 @@ int main() {
 
 ### 复杂
 
-> [!NOTE] **[LeetCode 753. 破解保险箱](https://leetcode-cn.com/problems/cracking-the-safe/)**
+> [!NOTE] **[LeetCode 753. 破解保险箱](https://leetcode.cn/problems/cracking-the-safe/)**
 > 
 > 题意: TODO
 
diff --git a/graph/lca.md b/graph/lca.md
index 505a07d..df1e82e 100644
--- a/graph/lca.md
+++ b/graph/lca.md
@@ -1458,7 +1458,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1257. 最小公共区域](https://leetcode-cn.com/problems/smallest-common-region/)**
+> [!NOTE] **[LeetCode 1257. 最小公共区域](https://leetcode.cn/problems/smallest-common-region/)**
 > 
 > 题意: TODO
 
diff --git a/graph/mst.md b/graph/mst.md
index 4bd7ed2..d4dd4c2 100644
--- a/graph/mst.md
+++ b/graph/mst.md
@@ -908,7 +908,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1135. 最低成本联通所有城市](https://leetcode-cn.com/problems/connecting-cities-with-minimum-cost/)**
+> [!NOTE] **[LeetCode 1135. 最低成本联通所有城市](https://leetcode.cn/problems/connecting-cities-with-minimum-cost/)**
 > 
 > 题意: TODO
 
@@ -1254,7 +1254,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1489. 找到最小生成树里的关键边和伪关键边](https://leetcode-cn.com/problems/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree/)**
+> [!NOTE] **[LeetCode 1489. 找到最小生成树里的关键边和伪关键边](https://leetcode.cn/problems/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree/)**
 > 
 > 题意: TODO
 
@@ -1426,7 +1426,7 @@ public:
 
 > [!TIP] **有 $nlogn$ 算法, 参见 poj 3241**
 
-> [!NOTE] **[LeetCode 1584. 连接所有点的最小费用](https://leetcode-cn.com/problems/min-cost-to-connect-all-points/)** [TAG]
+> [!NOTE] **[LeetCode 1584. 连接所有点的最小费用](https://leetcode.cn/problems/min-cost-to-connect-all-points/)** [TAG]
 > 
 > 题意: TODO
 
diff --git a/graph/shortest-path.md b/graph/shortest-path.md
index 0e91f24..ef659f6 100644
--- a/graph/shortest-path.md
+++ b/graph/shortest-path.md
@@ -905,7 +905,7 @@ if __name__ == '__main__':
 
 * * *
 
-> [!NOTE] **[LeetCode 743. 网络延迟时间](https://leetcode-cn.com/problems/network-delay-time/)**
+> [!NOTE] **[LeetCode 743. 网络延迟时间](https://leetcode.cn/problems/network-delay-time/)**
 > 
 > 题意: TODO
 
@@ -982,7 +982,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1514. 概率最大的路径](https://leetcode-cn.com/problems/path-with-maximum-probability/)**
+> [!NOTE] **[LeetCode 1514. 概率最大的路径](https://leetcode.cn/problems/path-with-maximum-probability/)**
 > 
 > 题意: TODO
 
@@ -1229,7 +1229,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1786. 从第一个节点出发到最后一个节点的受限路径数](https://leetcode-cn.com/problems/number-of-restricted-paths-from-first-to-last-node/)**
+> [!NOTE] **[LeetCode 1786. 从第一个节点出发到最后一个节点的受限路径数](https://leetcode.cn/problems/number-of-restricted-paths-from-first-to-last-node/)**
 > 
 > 题意: TODO
 
@@ -1390,7 +1390,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode LCP 35. 电动车游城市](https://leetcode-cn.com/problems/DFPeFJ/)**
+> [!NOTE] **[LeetCode LCP 35. 电动车游城市](https://leetcode.cn/problems/DFPeFJ/)**
 > 
 > 题意: TODO
 
@@ -1572,7 +1572,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2203 得到要求路径的最小带权子图](https://leetcode-cn.com/problems/minimum-weighted-subgraph-with-the-required-paths/)** [TAG]
+> [!NOTE] **[LeetCode 2203 得到要求路径的最小带权子图](https://leetcode.cn/problems/minimum-weighted-subgraph-with-the-required-paths/)** [TAG]
 > 
 > 题意: TODO
 
@@ -2325,7 +2325,7 @@ if __name__ == '__main__':
 
 * * *
 
-> [!NOTE] **[LeetCode 787. K 站中转内最便宜的航班](https://leetcode-cn.com/problems/cheapest-flights-within-k-stops/)**
+> [!NOTE] **[LeetCode 787. K 站中转内最便宜的航班](https://leetcode.cn/problems/cheapest-flights-within-k-stops/)**
 > 
 > 题意: TODO
 
@@ -4101,7 +4101,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1761. 一个图中连通三元组的最小度数](https://leetcode-cn.com/problems/minimum-degree-of-a-connected-trio-in-a-graph/)**
+> [!NOTE] **[LeetCode 1761. 一个图中连通三元组的最小度数](https://leetcode.cn/problems/minimum-degree-of-a-connected-trio-in-a-graph/)**
 > 
 > 题意: TODO
 
@@ -4440,7 +4440,7 @@ public:
 
 ### 拆点最短路 -> TODO 放到graph子章节
 
-> [!NOTE] **[LeetCode 1928. 规定时间内到达终点的最小花费](https://leetcode-cn.com/problems/minimum-cost-to-reach-destination-in-time/)** [TAG]
+> [!NOTE] **[LeetCode 1928. 规定时间内到达终点的最小花费](https://leetcode.cn/problems/minimum-cost-to-reach-destination-in-time/)** [TAG]
 > 
 > [biweekly 56](https://github.com/OpenKikCoc/LeetCode/tree/master/Contest/2021-07-10_Biweekly-56)
 > 
@@ -4576,7 +4576,7 @@ public:
 
 ### 次短路等
 
-> [!NOTE] **[AcWing 2045. 到达目的地的第二短时间](https://leetcode-cn.com/problems/second-minimum-time-to-reach-destination/)**
+> [!NOTE] **[AcWing 2045. 到达目的地的第二短时间](https://leetcode.cn/problems/second-minimum-time-to-reach-destination/)**
 > 
 > [weekly-263](https://github.com/OpenKikCoc/LeetCode/tree/master/Contest/2021-10-17_Weekly-263)
 > 
@@ -4935,7 +4935,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 建信03. 地铁路线规划](https://leetcode-cn.com/contest/ccbft-2021fall/problems/zQTFs4/)** [TAG]
+> [!NOTE] **[LeetCode 建信03. 地铁路线规划](https://leetcode.cn/contest/ccbft-2021fall/problems/zQTFs4/)** [TAG]
 > 
 > 题意: TODO
 
diff --git a/graph/topo.md b/graph/topo.md
index ee4d62d..d941184 100644
--- a/graph/topo.md
+++ b/graph/topo.md
@@ -877,7 +877,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1136. 平行课程](https://leetcode-cn.com/problems/parallel-courses/)**
+> [!NOTE] **[LeetCode 1136. 平行课程](https://leetcode.cn/problems/parallel-courses/)**
 > 
 > 题意: TODO
 
@@ -1000,7 +1000,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1857. 有向图中最大颜色值](https://leetcode-cn.com/problems/largest-color-value-in-a-directed-graph/)**
+> [!NOTE] **[LeetCode 1857. 有向图中最大颜色值](https://leetcode.cn/problems/largest-color-value-in-a-directed-graph/)**
 > 
 > 题意: TODO
 
@@ -1100,7 +1100,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2050. 并行课程 III](https://leetcode-cn.com/problems/parallel-courses-iii/)**
+> [!NOTE] **[LeetCode 2050. 并行课程 III](https://leetcode.cn/problems/parallel-courses-iii/)**
 > 
 > 题意: TODO
 
@@ -1185,7 +1185,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 207. 课程表](https://leetcode-cn.com/problems/course-schedule/)**
+> [!NOTE] **[LeetCode 207. 课程表](https://leetcode.cn/problems/course-schedule/)**
 > 
 > 题意: TODO
 
@@ -1290,7 +1290,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 210. 课程表 II](https://leetcode-cn.com/problems/course-schedule-ii/)**
+> [!NOTE] **[LeetCode 210. 课程表 II](https://leetcode.cn/problems/course-schedule-ii/)**
 > 
 > 题意: TODO
 
@@ -1534,7 +1534,7 @@ public:
 
 ### 拓扑排序方案数（可重集排序问题）
 
-> [!NOTE] **[LeetCode 1916. 统计为蚁群构筑房间的不同顺序](https://leetcode-cn.com/problems/count-ways-to-build-rooms-in-an-ant-colony/)**
+> [!NOTE] **[LeetCode 1916. 统计为蚁群构筑房间的不同顺序](https://leetcode.cn/problems/count-ways-to-build-rooms-in-an-ant-colony/)**
 > 
 > [weekly-247](https://github.com/OpenKikCoc/LeetCode/tree/master/Contest/2021-06-27_Weekly-247)
 > 
@@ -1630,7 +1630,7 @@ public:
 
 ### 进阶应用
 
-> [!NOTE] **[LeetCode 1203. 项目管理](https://leetcode-cn.com/problems/sort-items-by-groups-respecting-dependencies/)** [TAG]
+> [!NOTE] **[LeetCode 1203. 项目管理](https://leetcode.cn/problems/sort-items-by-groups-respecting-dependencies/)** [TAG]
 > 
 > 题意: TODO
 
@@ -1726,7 +1726,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1591. 奇怪的打印机 II](https://leetcode-cn.com/problems/strange-printer-ii/)** [TAG]
+> [!NOTE] **[LeetCode 1591. 奇怪的打印机 II](https://leetcode.cn/problems/strange-printer-ii/)** [TAG]
 > 
 > 题意: TODO
 
@@ -1810,7 +1810,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1632. 矩阵转换后的秩](https://leetcode-cn.com/problems/rank-transform-of-a-matrix/)** [TAG]
+> [!NOTE] **[LeetCode 1632. 矩阵转换后的秩](https://leetcode.cn/problems/rank-transform-of-a-matrix/)** [TAG]
 > 
 > 题意: TODO
 
@@ -2040,7 +2040,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2115. 从给定原材料中找到所有可以做出的菜](https://leetcode-cn.com/problems/find-all-possible-recipes-from-given-supplies/)** [TAG]
+> [!NOTE] **[LeetCode 2115. 从给定原材料中找到所有可以做出的菜](https://leetcode.cn/problems/find-all-possible-recipes-from-given-supplies/)** [TAG]
 > 
 > 题意: TODO
 
diff --git a/graph/tree-basic.md b/graph/tree-basic.md
index 7f92e2a..6514609 100644
--- a/graph/tree-basic.md
+++ b/graph/tree-basic.md
@@ -257,7 +257,7 @@ dfs(root, EMPTY_NODE);
 
 ### 前序
 
-> [!NOTE] **[LeetCode 144. 二叉树的前序遍历](https://leetcode-cn.com/problems/binary-tree-preorder-traversal/)**
+> [!NOTE] **[LeetCode 144. 二叉树的前序遍历](https://leetcode.cn/problems/binary-tree-preorder-traversal/)**
 > 
 > 题意: TODO
 
@@ -380,7 +380,7 @@ class Solution:
 
 ### 中序
 
-> [!NOTE] **[LeetCode 94. 二叉树的中序遍历](https://leetcode-cn.com/problems/binary-tree-inorder-traversal/)**
+> [!NOTE] **[LeetCode 94. 二叉树的中序遍历](https://leetcode.cn/problems/binary-tree-inorder-traversal/)**
 > 
 > 题意: TODO
 
@@ -514,7 +514,7 @@ class Solution:
 
 ### 后序
 
-> [!NOTE] **[LeetCode 145. 二叉树的后序遍历](https://leetcode-cn.com/problems/binary-tree-postorder-traversal/)**
+> [!NOTE] **[LeetCode 145. 二叉树的后序遍历](https://leetcode.cn/problems/binary-tree-postorder-traversal/)**
 > 
 > 题意: TODO
 
diff --git a/graph/tree-hash.md b/graph/tree-hash.md
index fe9ea3f..7ee1acd 100644
--- a/graph/tree-hash.md
+++ b/graph/tree-hash.md
@@ -171,7 +171,7 @@ $prime(i)$ 表示第 $i$ 个质数。
 
 ## 习题
 
-> [!NOTE] **[LeetCode 572. 另一个树的子树](https://leetcode-cn.com/problems/subtree-of-another-tree/)**
+> [!NOTE] **[LeetCode 572. 另一个树的子树](https://leetcode.cn/problems/subtree-of-another-tree/)**
 > 
 > 题意: TODO
 
@@ -242,7 +242,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 652. 寻找重复的子树](https://leetcode-cn.com/problems/find-duplicate-subtrees/)**
+> [!NOTE] **[LeetCode 652. 寻找重复的子树](https://leetcode.cn/problems/find-duplicate-subtrees/)**
 > 
 > 题意: TODO
 
diff --git a/lang/algorithm.md b/lang/algorithm.md
index e49b8a1..2cab375 100644
--- a/lang/algorithm.md
+++ b/lang/algorithm.md
@@ -145,7 +145,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 31. 下一个排列](https://leetcode-cn.com/problems/next-permutation/)**
+> [!NOTE] **[LeetCode 31. 下一个排列](https://leetcode.cn/problems/next-permutation/)**
 > 
 > 题意: TODO
 
@@ -218,7 +218,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1830. 使字符串有序的最少操作次数](https://leetcode-cn.com/problems/minimum-number-of-operations-to-make-string-sorted/)** [TAG]
+> [!NOTE] **[LeetCode 1830. 使字符串有序的最少操作次数](https://leetcode.cn/problems/minimum-number-of-operations-to-make-string-sorted/)** [TAG]
 > 
 > 题意: TODO
 
@@ -412,7 +412,7 @@ public:
 
 ### min
 
-> [!NOTE] **[LeetCode 1189. “气球” 的最大数量](https://leetcode-cn.com/problems/maximum-number-of-balloons/)**
+> [!NOTE] **[LeetCode 1189. “气球” 的最大数量](https://leetcode.cn/problems/maximum-number-of-balloons/)**
 > 
 > 题意: TODO
 
diff --git a/lang/bitset.md b/lang/bitset.md
index 36b45a8..f93f111 100644
--- a/lang/bitset.md
+++ b/lang/bitset.md
@@ -249,7 +249,7 @@ $$
 
 ## 习题
 
-> [!NOTE] **[LeetCode 187. 重复的DNA序列](https://leetcode-cn.com/problems/repeated-dna-sequences/)**
+> [!NOTE] **[LeetCode 187. 重复的DNA序列](https://leetcode.cn/problems/repeated-dna-sequences/)**
 > 
 > 题意: TODO
 
@@ -333,7 +333,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 416. 分割等和子集](https://leetcode-cn.com/problems/partition-equal-subset-sum/)**
+> [!NOTE] **[LeetCode 416. 分割等和子集](https://leetcode.cn/problems/partition-equal-subset-sum/)**
 > 
 > 题意: TODO
 
@@ -426,7 +426,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1452. 收藏清单](https://leetcode-cn.com/problems/people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list/)**
+> [!NOTE] **[LeetCode 1452. 收藏清单](https://leetcode.cn/problems/people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list/)**
 > 
 > 题意: TODO
 
diff --git a/math/bignum.md b/math/bignum.md
index f709bf2..e0f5e18 100644
--- a/math/bignum.md
+++ b/math/bignum.md
@@ -643,7 +643,7 @@ void karatsuba_mul(int a[], int b[], int c[]) {
 
 ### 高精度综合应用
 
-> [!NOTE] **[LeetCode 306. 累加数](https://leetcode-cn.com/problems/additive-number/)**
+> [!NOTE] **[LeetCode 306. 累加数](https://leetcode.cn/problems/additive-number/)**
 > 
 > 题意: TODO
 
diff --git a/math/bit.md b/math/bit.md
index 7bf4330..34d104f 100644
--- a/math/bit.md
+++ b/math/bit.md
@@ -326,7 +326,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 190. 颠倒二进制位](https://leetcode-cn.com/problems/reverse-bits/)**
+> [!NOTE] **[LeetCode 190. 颠倒二进制位](https://leetcode.cn/problems/reverse-bits/)**
 > 
 > 题意: TODO
 
@@ -372,7 +372,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 191. 位1的个数](https://leetcode-cn.com/problems/number-of-1-bits/)**
+> [!NOTE] **[LeetCode 191. 位1的个数](https://leetcode.cn/problems/number-of-1-bits/)**
 > 
 > 题意: TODO
 
@@ -430,7 +430,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 231. 2的幂](https://leetcode-cn.com/problems/power-of-two/)**
+> [!NOTE] **[LeetCode 231. 2的幂](https://leetcode.cn/problems/power-of-two/)**
 > 
 > 题意: TODO
 
@@ -466,7 +466,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 326. 3的幂](https://leetcode-cn.com/problems/power-of-three/)**
+> [!NOTE] **[LeetCode 326. 3的幂](https://leetcode.cn/problems/power-of-three/)**
 > 
 > 题意: TODO
 
@@ -502,7 +502,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 342. 4的幂](https://leetcode-cn.com/problems/power-of-four/)**
+> [!NOTE] **[LeetCode 342. 4的幂](https://leetcode.cn/problems/power-of-four/)**
 > 
 > 题意: TODO
 
@@ -555,7 +555,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 693. 交替位二进制数](https://leetcode-cn.com/problems/binary-number-with-alternating-bits/)**
+> [!NOTE] **[LeetCode 693. 交替位二进制数](https://leetcode.cn/problems/binary-number-with-alternating-bits/)**
 > 
 > 题意: TODO
 
@@ -610,7 +610,7 @@ public:
 
 ### 数值操作
 
-> [!NOTE] **[LeetCode 371. 两整数之和](https://leetcode-cn.com/problems/sum-of-two-integers/)**
+> [!NOTE] **[LeetCode 371. 两整数之和](https://leetcode.cn/problems/sum-of-two-integers/)**
 > 
 > 题意: TODO
 
@@ -654,7 +654,7 @@ public:
 
 ### 位维护状态
 
-> [!NOTE] **[LeetCode 289. 生命游戏](https://leetcode-cn.com/problems/game-of-life/)**
+> [!NOTE] **[LeetCode 289. 生命游戏](https://leetcode.cn/problems/game-of-life/)**
 > 
 > 题意: TODO
 
@@ -751,7 +751,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1178. 猜字谜](https://leetcode-cn.com/problems/number-of-valid-words-for-each-puzzle/)**
+> [!NOTE] **[LeetCode 1178. 猜字谜](https://leetcode.cn/problems/number-of-valid-words-for-each-puzzle/)**
 > 
 > 题意: TODO
 
@@ -811,7 +811,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1371. 每个元音包含偶数次的最长子字符串](https://leetcode-cn.com/problems/find-the-longest-substring-containing-vowels-in-even-counts/)** [TAG]
+> [!NOTE] **[LeetCode 1371. 每个元音包含偶数次的最长子字符串](https://leetcode.cn/problems/find-the-longest-substring-containing-vowels-in-even-counts/)** [TAG]
 > 
 > 题意: TODO
 
@@ -867,7 +867,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1386. 安排电影院座位](https://leetcode-cn.com/problems/cinema-seat-allocation/)** [TAG]
+> [!NOTE] **[LeetCode 1386. 安排电影院座位](https://leetcode.cn/problems/cinema-seat-allocation/)** [TAG]
 > 
 > 题意: TODO
 
@@ -946,7 +946,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1442. 形成两个异或相等数组的三元组数目](https://leetcode-cn.com/problems/count-triplets-that-can-form-two-arrays-of-equal-xor/)**
+> [!NOTE] **[LeetCode 1442. 形成两个异或相等数组的三元组数目](https://leetcode.cn/problems/count-triplets-that-can-form-two-arrays-of-equal-xor/)**
 > 
 > 题意: TODO
 
@@ -1023,7 +1023,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1461. 检查一个字符串是否包含所有长度为 K 的二进制子串](https://leetcode-cn.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k/)**
+> [!NOTE] **[LeetCode 1461. 检查一个字符串是否包含所有长度为 K 的二进制子串](https://leetcode.cn/problems/check-if-a-string-contains-all-binary-codes-of-size-k/)**
 > 
 > 题意: TODO
 
@@ -1071,7 +1071,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1542. 找出最长的超赞子字符串](https://leetcode-cn.com/problems/find-longest-awesome-substring/)**
+> [!NOTE] **[LeetCode 1542. 找出最长的超赞子字符串](https://leetcode.cn/problems/find-longest-awesome-substring/)**
 > 
 > 题意: TODO
 
@@ -1243,7 +1243,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 458. 可怜的小猪](https://leetcode-cn.com/problems/poor-pigs/)**
+> [!NOTE] **[LeetCode 458. 可怜的小猪](https://leetcode.cn/problems/poor-pigs/)**
 > 
 > 题意: TODO
 
@@ -1285,7 +1285,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1734. 解码异或后的排列](https://leetcode-cn.com/problems/decode-xored-permutation/)**
+> [!NOTE] **[LeetCode 1734. 解码异或后的排列](https://leetcode.cn/problems/decode-xored-permutation/)**
 > 
 > 题意: TODO
 
@@ -1497,7 +1497,7 @@ public:
 
 ### 思想
 
-> [!NOTE] **[LeetCode 201. 数字范围按位与](https://leetcode-cn.com/problems/bitwise-and-of-numbers-range/)**
+> [!NOTE] **[LeetCode 201. 数字范围按位与](https://leetcode.cn/problems/bitwise-and-of-numbers-range/)**
 > 
 > 题意: TODO
 
@@ -1556,7 +1556,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1558. 得到目标数组的最少函数调用次数](https://leetcode-cn.com/problems/minimum-numbers-of-function-calls-to-make-target-array/)** [TAG]
+> [!NOTE] **[LeetCode 1558. 得到目标数组的最少函数调用次数](https://leetcode.cn/problems/minimum-numbers-of-function-calls-to-make-target-array/)** [TAG]
 > 
 > 题意: TODO
 
@@ -1651,7 +1651,7 @@ public:
 
 ### 经典位划分
 
-> [!NOTE] **[LeetCode 136. 只出现一次的数字](https://leetcode-cn.com/problems/single-number/)**
+> [!NOTE] **[LeetCode 136. 只出现一次的数字](https://leetcode.cn/problems/single-number/)**
 > 
 > 题意: TODO
 
@@ -1697,7 +1697,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 137. 只出现一次的数字 II](https://leetcode-cn.com/problems/single-number-ii/)**
+> [!NOTE] **[LeetCode 137. 只出现一次的数字 II](https://leetcode.cn/problems/single-number-ii/)**
 > 
 > 题意: TODO
 
@@ -1801,7 +1801,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 260. 只出现一次的数字 III](https://leetcode-cn.com/problems/single-number-iii/)**
+> [!NOTE] **[LeetCode 260. 只出现一次的数字 III](https://leetcode.cn/problems/single-number-iii/)**
 > 
 > 题意: TODO
 
@@ -1875,7 +1875,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 268. 丢失的数字](https://leetcode-cn.com/problems/missing-number/)**
+> [!NOTE] **[LeetCode 268. 丢失的数字](https://leetcode.cn/problems/missing-number/)**
 > 
 > 题意: TODO
 
@@ -1931,7 +1931,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 477. 汉明距离总和](https://leetcode-cn.com/problems/total-hamming-distance/)**
+> [!NOTE] **[LeetCode 477. 汉明距离总和](https://leetcode.cn/problems/total-hamming-distance/)**
 > 
 > 题意: TODO
 
@@ -1991,7 +1991,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1835. 所有数对按位与结果的异或和](https://leetcode-cn.com/problems/find-xor-sum-of-all-pairs-bitwise-and/)**
+> [!NOTE] **[LeetCode 1835. 所有数对按位与结果的异或和](https://leetcode.cn/problems/find-xor-sum-of-all-pairs-bitwise-and/)**
 > 
 > 题意: TODO
 
diff --git a/math/combinatorics/cantor.md b/math/combinatorics/cantor.md
index 746343b..e3fcb64 100644
--- a/math/combinatorics/cantor.md
+++ b/math/combinatorics/cantor.md
@@ -40,7 +40,7 @@ $21-3\times 3!=3$，$\lfloor\frac {3}{2!}\rfloor=1$，有一个数小于它，
 
 实际上我们得到了形如 **有两个数小于它** 这一结论，就知道它是当前第 $3$ 个没有被选上的数，这里也可以用线段树维护，时间复杂度为 $O(n\log n)$。
 
-> [!NOTE] **[LeetCode 60. 排列序列](https://leetcode-cn.com/problems/permutation-sequence/)**
+> [!NOTE] **[LeetCode 60. 排列序列](https://leetcode.cn/problems/permutation-sequence/)**
 > 
 > 题意: TODO
 
diff --git a/math/combinatorics/combination.md b/math/combinatorics/combination.md
index 02654b7..400f792 100644
--- a/math/combinatorics/combination.md
+++ b/math/combinatorics/combination.md
@@ -1137,7 +1137,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1569. 将子数组重新排序得到同一个二叉查找树的方案数](https://leetcode-cn.com/problems/number-of-ways-to-reorder-array-to-get-same-bst/)** [TAG]
+> [!NOTE] **[LeetCode 1569. 将子数组重新排序得到同一个二叉查找树的方案数](https://leetcode.cn/problems/number-of-ways-to-reorder-array-to-get-same-bst/)** [TAG]
 > 
 > 题意: TODO
 
@@ -1251,7 +1251,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1573. 分割字符串的方案数](https://leetcode-cn.com/problems/number-of-ways-to-split-a-string/)**
+> [!NOTE] **[LeetCode 1573. 分割字符串的方案数](https://leetcode.cn/problems/number-of-ways-to-split-a-string/)**
 > 
 > 题意: TODO
 
@@ -1298,7 +1298,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1735. 生成乘积数组的方案数](https://leetcode-cn.com/problems/count-ways-to-make-array-with-product/)**
+> [!NOTE] **[LeetCode 1735. 生成乘积数组的方案数](https://leetcode.cn/problems/count-ways-to-make-array-with-product/)**
 > 
 > 题意: TODO
 
@@ -1375,7 +1375,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 建信04. 电学实验课](https://leetcode-cn.com/contest/ccbft-2021fall/problems/lSjqMF/)** [TAG]
+> [!NOTE] **[LeetCode 建信04. 电学实验课](https://leetcode.cn/contest/ccbft-2021fall/problems/lSjqMF/)** [TAG]
 > 
 > 题意: TODO
 
diff --git a/math/combinatorics/inclusion-exclusion-principle.md b/math/combinatorics/inclusion-exclusion-principle.md
index a1b6bf8..af0713f 100644
--- a/math/combinatorics/inclusion-exclusion-principle.md
+++ b/math/combinatorics/inclusion-exclusion-principle.md
@@ -842,7 +842,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1201. 丑数 III](https://leetcode-cn.com/problems/ugly-number-iii/)** [TAG]
+> [!NOTE] **[LeetCode 1201. 丑数 III](https://leetcode.cn/problems/ugly-number-iii/)** [TAG]
 > 
 > 题意: TODO
 
diff --git a/math/game-theory/impartial-game.md b/math/game-theory/impartial-game.md
index e3be3fc..5d76e0f 100644
--- a/math/game-theory/impartial-game.md
+++ b/math/game-theory/impartial-game.md
@@ -397,7 +397,7 @@ int main() {
 
 ### 石子游戏
 
-> [!NOTE] **[LeetCode 1140. 石子游戏 II](https://leetcode-cn.com/problems/stone-game-ii/)**
+> [!NOTE] **[LeetCode 1140. 石子游戏 II](https://leetcode.cn/problems/stone-game-ii/)**
 > 
 > 题意: TODO
 
@@ -464,7 +464,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1406. 石子游戏 III](https://leetcode-cn.com/problems/stone-game-iii/)**
+> [!NOTE] **[LeetCode 1406. 石子游戏 III](https://leetcode.cn/problems/stone-game-iii/)**
 > 
 > 题意: TODO
 
@@ -515,7 +515,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1510. 石子游戏 IV](https://leetcode-cn.com/problems/stone-game-iv/)**
+> [!NOTE] **[LeetCode 1510. 石子游戏 IV](https://leetcode.cn/problems/stone-game-iv/)**
 > 
 > 题意: TODO
 
@@ -557,7 +557,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1686. 石子游戏 VI](https://leetcode-cn.com/problems/stone-game-vi/)**
+> [!NOTE] **[LeetCode 1686. 石子游戏 VI](https://leetcode.cn/problems/stone-game-vi/)**
 > 
 > 题意: TODO
 
@@ -611,7 +611,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1690. 石子游戏 VII](https://leetcode-cn.com/problems/stone-game-vii/)**
+> [!NOTE] **[LeetCode 1690. 石子游戏 VII](https://leetcode.cn/problems/stone-game-vii/)**
 > 
 > 题意: TODO
 
@@ -657,7 +657,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1872. 石子游戏 VIII](https://leetcode-cn.com/problems/stone-game-viii/)** [TAG]
+> [!NOTE] **[LeetCode 1872. 石子游戏 VIII](https://leetcode.cn/problems/stone-game-viii/)** [TAG]
 > 
 > 题意: TODO
 
diff --git a/math/game-theory/thinking.md b/math/game-theory/thinking.md
index 5311757..0e1a348 100644
--- a/math/game-theory/thinking.md
+++ b/math/game-theory/thinking.md
@@ -1,7 +1,7 @@
 ## 习题
 
 
-> [!NOTE] **[LeetCode 1145. 二叉树着色游戏](https://leetcode-cn.com/problems/binary-tree-coloring-game/)**
+> [!NOTE] **[LeetCode 1145. 二叉树着色游戏](https://leetcode.cn/problems/binary-tree-coloring-game/)**
 > 
 > 题意: TODO
 
@@ -77,7 +77,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1728. 猫和老鼠 II](https://leetcode-cn.com/problems/cat-and-mouse-ii/)** [TAG]
+> [!NOTE] **[LeetCode 1728. 猫和老鼠 II](https://leetcode.cn/problems/cat-and-mouse-ii/)** [TAG]
 > 
 > 题意: TODO
 
@@ -158,7 +158,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1927. 求和游戏](https://leetcode-cn.com/problems/sum-game/)**
+> [!NOTE] **[LeetCode 1927. 求和游戏](https://leetcode.cn/problems/sum-game/)**
 > 
 > 题意: TODO
 
@@ -248,7 +248,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2029. 石子游戏 IX](https://leetcode-cn.com/problems/stone-game-ix/)** [TAG]
+> [!NOTE] **[LeetCode 2029. 石子游戏 IX](https://leetcode.cn/problems/stone-game-ix/)** [TAG]
 > 
 > 题意: TODO
 
diff --git a/math/newton.md b/math/newton.md
index 2efc9d9..6cfa41c 100644
--- a/math/newton.md
+++ b/math/newton.md
@@ -121,7 +121,7 @@ public static BigInteger isqrtNewton(BigInteger n) {
 ## 习题
 
 - [UVa 10428 - The Roots](https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=16&page=show_problem&problem=1369)
--   [LeetCode 69. x 的平方根](https://leetcode-cn.com/problems/sqrtx/)
+-   [LeetCode 69. x 的平方根](https://leetcode.cn/problems/sqrtx/)
 
 
 > [!NOTE] **[Luogu [NOIP2001 提高组] 一元三次方程求解](https://www.luogu.com.cn/problem/P1024)**
@@ -189,7 +189,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 69. x 的平方根](https://leetcode-cn.com/problems/sqrtx/)**
+> [!NOTE] **[LeetCode 69. x 的平方根](https://leetcode.cn/problems/sqrtx/)**
 > 
 > 题意: TODO
 
@@ -252,7 +252,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 367. 有效的完全平方数](https://leetcode-cn.com/problems/valid-perfect-square/)**
+> [!NOTE] **[LeetCode 367. 有效的完全平方数](https://leetcode.cn/problems/valid-perfect-square/)**
 > 
 > 题意: TODO
 
diff --git a/math/number-theory/gcd.md b/math/number-theory/gcd.md
index 58c0a05..32554ff 100644
--- a/math/number-theory/gcd.md
+++ b/math/number-theory/gcd.md
@@ -410,7 +410,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 650. 只有两个键的键盘](https://leetcode-cn.com/problems/2-keys-keyboard/)**
+> [!NOTE] **[LeetCode 650. 只有两个键的键盘](https://leetcode.cn/problems/2-keys-keyboard/)**
 > 
 > 题意: TODO
 
@@ -476,7 +476,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1250. 检查「好数组」](https://leetcode-cn.com/problems/check-if-it-is-a-good-array/)**
+> [!NOTE] **[LeetCode 1250. 检查「好数组」](https://leetcode.cn/problems/check-if-it-is-a-good-array/)**
 > 
 > 题意: TODO
 
@@ -515,7 +515,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1819. 序列中不同最大公约数的数目](https://leetcode-cn.com/problems/number-of-different-subsequences-gcds/)**
+> [!NOTE] **[LeetCode 1819. 序列中不同最大公约数的数目](https://leetcode.cn/problems/number-of-different-subsequences-gcds/)**
 > 
 > 题意: TODO
 
@@ -571,7 +571,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2001. 可互换矩形的组数](https://leetcode-cn.com/problems/number-of-pairs-of-interchangeable-rectangles/)**
+> [!NOTE] **[LeetCode 2001. 可互换矩形的组数](https://leetcode.cn/problems/number-of-pairs-of-interchangeable-rectangles/)**
 > 
 > 题意: TODO
 
@@ -1111,7 +1111,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1808. 好因子的最大数目](https://leetcode-cn.com/problems/maximize-number-of-nice-divisors/)**
+> [!NOTE] **[LeetCode 1808. 好因子的最大数目](https://leetcode.cn/problems/maximize-number-of-nice-divisors/)**
 > 
 > 题意: TODO
 
@@ -1401,7 +1401,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 780. 到达终点](https://leetcode-cn.com/problems/reaching-points/)**
+> [!NOTE] **[LeetCode 780. 到达终点](https://leetcode.cn/problems/reaching-points/)**
 > 
 > 题意: TODO
 
@@ -1596,7 +1596,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1354. 多次求和构造目标数组](https://leetcode-cn.com/problems/construct-target-array-with-multiple-sums/)**
+> [!NOTE] **[LeetCode 1354. 多次求和构造目标数组](https://leetcode.cn/problems/construct-target-array-with-multiple-sums/)**
 > 
 > 题意: TODO
 
diff --git a/math/number-theory/inverse.md b/math/number-theory/inverse.md
index bd16edc..2a498a7 100644
--- a/math/number-theory/inverse.md
+++ b/math/number-theory/inverse.md
@@ -314,7 +314,7 @@ for i in range(1, n + 1):
 
 ## 习题
 
-> [!NOTE] **[LeetCode 1622. 奇妙序列](https://leetcode-cn.com/problems/fancy-sequence/)** [TAG]
+> [!NOTE] **[LeetCode 1622. 奇妙序列](https://leetcode.cn/problems/fancy-sequence/)** [TAG]
 > 
 > 题意: TODO
 
diff --git a/math/number-theory/prime.md b/math/number-theory/prime.md
index a703d2c..9670b36 100644
--- a/math/number-theory/prime.md
+++ b/math/number-theory/prime.md
@@ -567,7 +567,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1175. 质数排列](https://leetcode-cn.com/problems/prime-arrangements/)**
+> [!NOTE] **[LeetCode 1175. 质数排列](https://leetcode.cn/problems/prime-arrangements/)**
 > 
 > 题意: TODO
 
diff --git a/math/number-theory/sieve.md b/math/number-theory/sieve.md
index 7e69c9f..97236db 100644
--- a/math/number-theory/sieve.md
+++ b/math/number-theory/sieve.md
@@ -559,7 +559,7 @@ def pre():
 
 ### 一般筛法
 
-> [!NOTE] **[LeetCode 1390. 四因数](https://leetcode-cn.com/problems/four-divisors/)**
+> [!NOTE] **[LeetCode 1390. 四因数](https://leetcode.cn/problems/four-divisors/)**
 > 
 > 题意: 
 > 
diff --git a/math/quick-pow.md b/math/quick-pow.md
index f697cfd..856a688 100644
--- a/math/quick-pow.md
+++ b/math/quick-pow.md
@@ -522,7 +522,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 372. 超级次方](https://leetcode-cn.com/problems/super-pow/)**
+> [!NOTE] **[LeetCode 372. 超级次方](https://leetcode.cn/problems/super-pow/)**
 > 
 > 题意: TODO
 
diff --git a/math/theory.md b/math/theory.md
index 481cf6b..b46e120 100644
--- a/math/theory.md
+++ b/math/theory.md
@@ -59,7 +59,7 @@ public:
 
 ### 拉格朗日四平方和
 
-> [!NOTE] **[LeetCode 279. 完全平方数](https://leetcode-cn.com/problems/perfect-squares/)**
+> [!NOTE] **[LeetCode 279. 完全平方数](https://leetcode.cn/problems/perfect-squares/)**
 > 
 > 题意: TODO
 
@@ -162,7 +162,7 @@ class Solution:
 
 ### 约数与完全平方数
 
-> [!NOTE] **[LeetCode 319. 灯泡开关](https://leetcode-cn.com/problems/bulb-switcher/)**
+> [!NOTE] **[LeetCode 319. 灯泡开关](https://leetcode.cn/problems/bulb-switcher/)**
 > 
 > 题意: TODO
 
@@ -204,7 +204,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 672. 灯泡开关 Ⅱ](https://leetcode-cn.com/problems/bulb-switcher-ii/)**
+> [!NOTE] **[LeetCode 672. 灯泡开关 Ⅱ](https://leetcode.cn/problems/bulb-switcher-ii/)**
 > 
 > 题意: TODO
 
@@ -284,7 +284,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1375. 灯泡开关 III](https://leetcode-cn.com/problems/bulb-switcher-iii/)**
+> [!NOTE] **[LeetCode 1375. 灯泡开关 III](https://leetcode.cn/problems/bulb-switcher-iii/)**
 > 
 > 题意: TODO
 
@@ -329,7 +329,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1529. 灯泡开关 IV](https://leetcode-cn.com/problems/bulb-switcher-iv/)**
+> [!NOTE] **[LeetCode 1529. 灯泡开关 IV](https://leetcode.cn/problems/bulb-switcher-iv/)**
 > 
 > 题意: TODO
 
@@ -391,7 +391,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 365. 水壶问题](https://leetcode-cn.com/problems/water-and-jug-problem/)**
+> [!NOTE] **[LeetCode 365. 水壶问题](https://leetcode.cn/problems/water-and-jug-problem/)**
 > 
 > 题意: TODO
 
diff --git a/math/thinking.md b/math/thinking.md
index 5694a34..a27d8d3 100644
--- a/math/thinking.md
+++ b/math/thinking.md
@@ -43,7 +43,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 222. 完全二叉树的节点个数](https://leetcode-cn.com/problems/count-complete-tree-nodes/)**
+> [!NOTE] **[LeetCode 222. 完全二叉树的节点个数](https://leetcode.cn/problems/count-complete-tree-nodes/)**
 > 
 > 题意: TODO
 
@@ -126,7 +126,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 223. 矩形面积](https://leetcode-cn.com/problems/rectangle-area/)**
+> [!NOTE] **[LeetCode 223. 矩形面积](https://leetcode.cn/problems/rectangle-area/)**
 > 
 > 题意: TODO
 
@@ -166,7 +166,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 441. 排列硬币](https://leetcode-cn.com/problems/arranging-coins/)**
+> [!NOTE] **[LeetCode 441. 排列硬币](https://leetcode.cn/problems/arranging-coins/)**
 > 
 > 题意: TODO
 
@@ -209,7 +209,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 483. 最小好进制](https://leetcode-cn.com/problems/smallest-good-base/)**
+> [!NOTE] **[LeetCode 483. 最小好进制](https://leetcode.cn/problems/smallest-good-base/)**
 > 
 > 题意: TODO
 
@@ -256,7 +256,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 628. 三个数的最大乘积](https://leetcode-cn.com/problems/maximum-product-of-three-numbers/)**
+> [!NOTE] **[LeetCode 628. 三个数的最大乘积](https://leetcode.cn/problems/maximum-product-of-three-numbers/)**
 > 
 > 题意: TODO
 
@@ -303,7 +303,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 754. 到达终点数字](https://leetcode-cn.com/problems/reach-a-number/)**
+> [!NOTE] **[LeetCode 754. 到达终点数字](https://leetcode.cn/problems/reach-a-number/)**
 > 
 > 题意: TODO
 
@@ -343,7 +343,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 775. 全局倒置与局部倒置](https://leetcode-cn.com/problems/global-and-local-inversions/)**
+> [!NOTE] **[LeetCode 775. 全局倒置与局部倒置](https://leetcode.cn/problems/global-and-local-inversions/)**
 > 
 > 题意: TODO
 
@@ -382,7 +382,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 781. 森林中的兔子](https://leetcode-cn.com/problems/rabbits-in-forest/)**
+> [!NOTE] **[LeetCode 781. 森林中的兔子](https://leetcode.cn/problems/rabbits-in-forest/)**
 > 
 > 题意: TODO
 
@@ -446,7 +446,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1197. 进击的骑士](https://leetcode-cn.com/problems/minimum-knight-moves/)**
+> [!NOTE] **[LeetCode 1197. 进击的骑士](https://leetcode.cn/problems/minimum-knight-moves/)**
 > 
 > 题意: TODO
 
@@ -521,13 +521,13 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1330. 翻转子数组得到最大的数组值](https://leetcode-cn.com/problems/reverse-subarray-to-maximize-array-value/)** [TAG]
+> [!NOTE] **[LeetCode 1330. 翻转子数组得到最大的数组值](https://leetcode.cn/problems/reverse-subarray-to-maximize-array-value/)** [TAG]
 > 
 > 题意: TODO
 
 > [!TIP] **思路**
 >
-> 比赛的时候n^2 TLE一发 尝试优化表达式 思路可以参考 [这里](https://leetcode-cn.com/problems/reverse-subarray-to-maximize-array-value/solution/onzuo-fa-jie-jue-ci-wen-ti-by-hu-tu-tu-7/)
+> 比赛的时候n^2 TLE一发 尝试优化表达式 思路可以参考 [这里](https://leetcode.cn/problems/reverse-subarray-to-maximize-array-value/solution/onzuo-fa-jie-jue-ci-wen-ti-by-hu-tu-tu-7/)
 >
 > 更进一步：找到一个最大一个最小
 >
@@ -669,7 +669,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1359. 有效的快递序列数目](https://leetcode-cn.com/problems/count-all-valid-pickup-and-delivery-options/)** [TAG]
+> [!NOTE] **[LeetCode 1359. 有效的快递序列数目](https://leetcode.cn/problems/count-all-valid-pickup-and-delivery-options/)** [TAG]
 > 
 > 题意: TODO
 
@@ -714,7 +714,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1404. 将二进制表示减到 1 的步骤数](https://leetcode-cn.com/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one/)**
+> [!NOTE] **[LeetCode 1404. 将二进制表示减到 1 的步骤数](https://leetcode.cn/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one/)**
 > 
 > 题意: 
 > 
@@ -860,7 +860,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1518. 换酒问题](https://leetcode-cn.com/problems/water-bottles/)**
+> [!NOTE] **[LeetCode 1518. 换酒问题](https://leetcode.cn/problems/water-bottles/)**
 > 
 > 题意: TODO
 
@@ -901,7 +901,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1523. 在区间范围内统计奇数数目](https://leetcode-cn.com/problems/count-odd-numbers-in-an-interval-range/)**
+> [!NOTE] **[LeetCode 1523. 在区间范围内统计奇数数目](https://leetcode.cn/problems/count-odd-numbers-in-an-interval-range/)**
 > 
 > 题意: TODO
 
@@ -935,7 +935,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1526. 形成目标数组的子数组最少增加次数](https://leetcode-cn.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/)** [TAG]
+> [!NOTE] **[LeetCode 1526. 形成目标数组的子数组最少增加次数](https://leetcode.cn/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/)** [TAG]
 > 
 > 题意: TODO
 
@@ -1030,7 +1030,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1675. 数组的最小偏移量](https://leetcode-cn.com/problems/minimize-deviation-in-array/)**
+> [!NOTE] **[LeetCode 1675. 数组的最小偏移量](https://leetcode.cn/problems/minimize-deviation-in-array/)**
 > 
 > 题意: TODO
 
@@ -1055,7 +1055,7 @@ public:
         第二步:操作 1 的只会减少某个数的值,而只有减少最大值结果才可能更优.
         第三步:使用平衡树或堆维护最大值,直到最大值为奇数不能再操作为止.
     考虑优化:
-        https://leetcode-cn.com/problems/minimize-deviation-in-array/solution/yi-chong-fu-za-du-geng-di-de-zuo-fa-by-heltion-2/
+        https://leetcode.cn/problems/minimize-deviation-in-array/solution/yi-chong-fu-za-du-geng-di-de-zuo-fa-by-heltion-2/
     */
     int minimumDeviation(vector<int>& nums) {
         int n = nums.size(), mi = INT_MAX, res = INT_MAX;
@@ -1091,7 +1091,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1716. 计算力扣银行的钱](https://leetcode-cn.com/problems/calculate-money-in-leetcode-bank/)**
+> [!NOTE] **[LeetCode 1716. 计算力扣银行的钱](https://leetcode.cn/problems/calculate-money-in-leetcode-bank/)**
 > 
 > 题意: TODO
 
@@ -1173,7 +1173,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1726. 同积元组](https://leetcode-cn.com/problems/tuple-with-same-product/)**
+> [!NOTE] **[LeetCode 1726. 同积元组](https://leetcode.cn/problems/tuple-with-same-product/)**
 > 
 > 题意: TODO
 
@@ -1219,7 +1219,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1780. 判断一个数字是否可以表示成三的幂的和](https://leetcode-cn.com/problems/check-if-number-is-a-sum-of-powers-of-three/)**
+> [!NOTE] **[LeetCode 1780. 判断一个数字是否可以表示成三的幂的和](https://leetcode.cn/problems/check-if-number-is-a-sum-of-powers-of-three/)**
 > 
 > 题意: TODO
 
@@ -1258,7 +1258,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1806. 还原排列的最少操作步数](https://leetcode-cn.com/problems/minimum-number-of-operations-to-reinitialize-a-permutation/)**
+> [!NOTE] **[LeetCode 1806. 还原排列的最少操作步数](https://leetcode.cn/problems/minimum-number-of-operations-to-reinitialize-a-permutation/)**
 > 
 > 题意: TODO
 
@@ -1349,7 +1349,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1862. 向下取整数对和](https://leetcode-cn.com/problems/sum-of-floored-pairs/)**
+> [!NOTE] **[LeetCode 1862. 向下取整数对和](https://leetcode.cn/problems/sum-of-floored-pairs/)**
 > 
 > 题意: TODO
 
@@ -1456,7 +1456,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1904. 你完成的完整对局数](https://leetcode-cn.com/problems/the-number-of-full-rounds-you-have-played/)**
+> [!NOTE] **[LeetCode 1904. 你完成的完整对局数](https://leetcode.cn/problems/the-number-of-full-rounds-you-have-played/)**
 > 
 > 题意: TODO
 
@@ -1548,7 +1548,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1954. 收集足够苹果的最小花园周长](https://leetcode-cn.com/problems/minimum-garden-perimeter-to-collect-enough-apples/)**
+> [!NOTE] **[LeetCode 1954. 收集足够苹果的最小花园周长](https://leetcode.cn/problems/minimum-garden-perimeter-to-collect-enough-apples/)**
 > 
 > 题意: TODO
 
@@ -1644,7 +1644,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1969. 数组元素的最小非零乘积](https://leetcode-cn.com/problems/minimum-non-zero-product-of-the-array-elements/)**
+> [!NOTE] **[LeetCode 1969. 数组元素的最小非零乘积](https://leetcode.cn/problems/minimum-non-zero-product-of-the-array-elements/)**
 > 
 > 题意: TODO
 
@@ -1742,7 +1742,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1980. 找出不同的二进制字符串](https://leetcode-cn.com/problems/find-unique-binary-string/)**
+> [!NOTE] **[LeetCode 1980. 找出不同的二进制字符串](https://leetcode.cn/problems/find-unique-binary-string/)**
 > 
 > 题意: TODO
 
@@ -1817,7 +1817,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2183. 统计可以被 K 整除的下标对数目](https://leetcode-cn.com/problems/count-array-pairs-divisible-by-k/)** [TAG]
+> [!NOTE] **[LeetCode 2183. 统计可以被 K 整除的下标对数目](https://leetcode.cn/problems/count-array-pairs-divisible-by-k/)** [TAG]
 > 
 > 题意: TODO
 
@@ -1918,7 +1918,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 理财产品](https://leetcode-cn.com/contest/cnunionpay-2022spring/problems/I4mOGz/)**
+> [!NOTE] **[LeetCode 理财产品](https://leetcode.cn/contest/cnunionpay-2022spring/problems/I4mOGz/)**
 > 
 > 题意: TODO
 
diff --git a/misc/discrete.md b/misc/discrete.md
index e8a24ba..05429ea 100644
--- a/misc/discrete.md
+++ b/misc/discrete.md
@@ -302,7 +302,7 @@ if __name__ == "__main__":
 
 * * *
 
-> [!NOTE] **[LeetCode 2013. 检测正方形](https://leetcode-cn.com/problems/detect-squares/)**
+> [!NOTE] **[LeetCode 2013. 检测正方形](https://leetcode.cn/problems/detect-squares/)**
 > 
 > 题意: TODO
 
diff --git a/misc/expression.md b/misc/expression.md
index 2931634..6660bd3 100644
--- a/misc/expression.md
+++ b/misc/expression.md
@@ -146,7 +146,7 @@ int calc(const std::string &s) {  // 计算转换好的后缀表达式
 
 #### 表达式
 
-> [!NOTE] **[LeetCode 1896. 反转表达式值的最少操作次数](https://leetcode-cn.com/problems/minimum-cost-to-change-the-final-value-of-expression/)** [TAG]
+> [!NOTE] **[LeetCode 1896. 反转表达式值的最少操作次数](https://leetcode.cn/problems/minimum-cost-to-change-the-final-value-of-expression/)** [TAG]
 > 
 > [biweekly-54](https://github.com/OpenKikCoc/LeetCode/tree/master/Contest/2021-06-12_Biweekly-54#1896-反转表达式值的最少操作次数-tag)
 > 
@@ -237,7 +237,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2019. 解出数学表达式的学生分数](https://leetcode-cn.com/problems/the-score-of-students-solving-math-expression/)** [TAG]
+> [!NOTE] **[LeetCode 2019. 解出数学表达式的学生分数](https://leetcode.cn/problems/the-score-of-students-solving-math-expression/)** [TAG]
 > 
 > 题意: TODO
 
@@ -438,7 +438,7 @@ public:
 
 #### 基本计算器
 
-> [!NOTE] **[LeetCode 224. 基本计算器](https://leetcode-cn.com/problems/basic-calculator/)**
+> [!NOTE] **[LeetCode 224. 基本计算器](https://leetcode.cn/problems/basic-calculator/)**
 > 
 > 题意: TODO
 
@@ -562,7 +562,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 227. 基本计算器 II](https://leetcode-cn.com/problems/basic-calculator-ii/)**
+> [!NOTE] **[LeetCode 227. 基本计算器 II](https://leetcode.cn/problems/basic-calculator-ii/)**
 > 
 > 题意: TODO
 
@@ -666,7 +666,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 770. 基本计算器 IV](https://leetcode-cn.com/problems/basic-calculator-iv/)**
+> [!NOTE] **[LeetCode 770. 基本计算器 IV](https://leetcode.cn/problems/basic-calculator-iv/)**
 > 
 > 题意: TODO
 
@@ -809,7 +809,7 @@ public:
 
 ### 后缀
 
-> [!NOTE] **[LeetCode 150. 逆波兰表达式求值](https://leetcode-cn.com/problems/evaluate-reverse-polish-notation/)**
+> [!NOTE] **[LeetCode 150. 逆波兰表达式求值](https://leetcode.cn/problems/evaluate-reverse-polish-notation/)**
 > 
 > 题意: TODO
 
diff --git a/misc/gray-code.md b/misc/gray-code.md
index 5ccbc07..3b781c3 100644
--- a/misc/gray-code.md
+++ b/misc/gray-code.md
@@ -126,7 +126,7 @@ int rev_g(int g) {
 
 - [SGU #249 Matrix](http://codeforces.com/problemsets/acmsguru/problem/99999/249) Difficulty: medium
 
-> [!NOTE] **[LeetCode 89. 格雷编码](https://leetcode-cn.com/problems/gray-code/)**
+> [!NOTE] **[LeetCode 89. 格雷编码](https://leetcode.cn/problems/gray-code/)**
 > 
 > 题意: TODO
 
@@ -199,7 +199,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1238. 循环码排列](https://leetcode-cn.com/problems/circular-permutation-in-binary-representation/)**
+> [!NOTE] **[LeetCode 1238. 循环码排列](https://leetcode.cn/problems/circular-permutation-in-binary-representation/)**
 > 
 > 题意: TODO
 
@@ -260,7 +260,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1611. 使整数变为 0 的最少操作次数](https://leetcode-cn.com/problems/minimum-one-bit-operations-to-make-integers-zero/)** [TAG]
+> [!NOTE] **[LeetCode 1611. 使整数变为 0 的最少操作次数](https://leetcode.cn/problems/minimum-one-bit-operations-to-make-integers-zero/)** [TAG]
 > 
 > 题意: TODO
 
diff --git a/misc/josephus.md b/misc/josephus.md
index 373bf85..86b4ed1 100644
--- a/misc/josephus.md
+++ b/misc/josephus.md
@@ -84,7 +84,7 @@ $$
 
 ## 习题
 
-> [!NOTE] **[LeetCode 390. 消除游戏](https://leetcode-cn.com/problems/elimination-game/)**
+> [!NOTE] **[LeetCode 390. 消除游戏](https://leetcode.cn/problems/elimination-game/)**
 > 
 > 题意: TODO
 
diff --git a/misc/moore.md b/misc/moore.md
index 3f4e432..0bb0642 100644
--- a/misc/moore.md
+++ b/misc/moore.md
@@ -99,7 +99,7 @@ while (n--) {
 
 ## 习题
 
-> [!NOTE] **[LeetCode 169. 多数元素](https://leetcode-cn.com/problems/majority-element/)**
+> [!NOTE] **[LeetCode 169. 多数元素](https://leetcode.cn/problems/majority-element/)**
 > 
 > 题意: TODO
 
@@ -176,7 +176,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 229. 求众数 II](https://leetcode-cn.com/problems/majority-element-ii/)**
+> [!NOTE] **[LeetCode 229. 求众数 II](https://leetcode.cn/problems/majority-element-ii/)**
 > 
 > 题意: TODO
 
@@ -228,7 +228,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1287. 有序数组中出现次数超过25%的元素](https://leetcode-cn.com/problems/element-appearing-more-than-25-in-sorted-array/)**
+> [!NOTE] **[LeetCode 1287. 有序数组中出现次数超过25%的元素](https://leetcode.cn/problems/element-appearing-more-than-25-in-sorted-array/)**
 > 
 > 题意: TODO
 
diff --git a/misc/one-radish-one-pit.md b/misc/one-radish-one-pit.md
index b94fa19..9711009 100644
--- a/misc/one-radish-one-pit.md
+++ b/misc/one-radish-one-pit.md
@@ -1,6 +1,6 @@
 ## 习题
 
-> [!NOTE] **[LeetCode 41. 缺失的第一个正数](https://leetcode-cn.com/problems/first-missing-positive/)**
+> [!NOTE] **[LeetCode 41. 缺失的第一个正数](https://leetcode.cn/problems/first-missing-positive/)**
 > 
 > 题意: TODO
 
@@ -65,7 +65,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 442. 数组中重复的数据](https://leetcode-cn.com/problems/find-all-duplicates-in-an-array/)**
+> [!NOTE] **[LeetCode 442. 数组中重复的数据](https://leetcode.cn/problems/find-all-duplicates-in-an-array/)**
 > 
 > 题意: TODO
 
@@ -166,7 +166,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 448. 找到所有数组中消失的数字](https://leetcode-cn.com/problems/find-all-numbers-disappeared-in-an-array/)**
+> [!NOTE] **[LeetCode 448. 找到所有数组中消失的数字](https://leetcode.cn/problems/find-all-numbers-disappeared-in-an-array/)**
 > 
 > 题意: TODO
 
@@ -252,7 +252,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 287. 寻找重复数](https://leetcode-cn.com/problems/find-the-duplicate-number/)**
+> [!NOTE] **[LeetCode 287. 寻找重复数](https://leetcode.cn/problems/find-the-duplicate-number/)**
 > 
 > 题意: TODO
 
diff --git a/misc/random.md b/misc/random.md
index 7ec1ca9..7cc4102 100644
--- a/misc/random.md
+++ b/misc/random.md
@@ -374,7 +374,7 @@ int main() {
 
 ## 习题
 
-> [!NOTE] **[LeetCode 470. 用 Rand7() 实现 Rand10()](https://leetcode-cn.com/problems/implement-rand10-using-rand7/)**
+> [!NOTE] **[LeetCode 470. 用 Rand7() 实现 Rand10()](https://leetcode.cn/problems/implement-rand10-using-rand7/)**
 > 
 > 题意: TODO
 
@@ -447,7 +447,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 478. 在圆内随机生成点](https://leetcode-cn.com/problems/generate-random-point-in-a-circle/)**
+> [!NOTE] **[LeetCode 478. 在圆内随机生成点](https://leetcode.cn/problems/generate-random-point-in-a-circle/)**
 > 
 > 题意: TODO
 
@@ -513,7 +513,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 497. 非重叠矩形中的随机点](https://leetcode-cn.com/problems/random-point-in-non-overlapping-rectangles/)**
+> [!NOTE] **[LeetCode 497. 非重叠矩形中的随机点](https://leetcode.cn/problems/random-point-in-non-overlapping-rectangles/)**
 > 
 > 题意: TODO
 
@@ -584,7 +584,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 519. 随机翻转矩阵](https://leetcode-cn.com/problems/random-flip-matrix/)**
+> [!NOTE] **[LeetCode 519. 随机翻转矩阵](https://leetcode.cn/problems/random-flip-matrix/)**
 > 
 > 题意: TODO
 
@@ -652,7 +652,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 528. 按权重随机选择](https://leetcode-cn.com/problems/random-pick-with-weight/)**
+> [!NOTE] **[LeetCode 528. 按权重随机选择](https://leetcode.cn/problems/random-pick-with-weight/)**
 > 
 > 题意: TODO
 
@@ -706,7 +706,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 710. 黑名单中的随机数](https://leetcode-cn.com/problems/random-pick-with-blacklist/)**
+> [!NOTE] **[LeetCode 710. 黑名单中的随机数](https://leetcode.cn/problems/random-pick-with-blacklist/)**
 > 
 > 题意: TODO
 
diff --git a/misc/simulated-annealing.md b/misc/simulated-annealing.md
index d297eb1..714bc3e 100644
--- a/misc/simulated-annealing.md
+++ b/misc/simulated-annealing.md
@@ -384,13 +384,13 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1521. 找到最接近目标值的函数值](https://leetcode-cn.com/problems/find-a-value-of-a-mysterious-function-closest-to-target/)** [TAG]
+> [!NOTE] **[LeetCode 1521. 找到最接近目标值的函数值](https://leetcode.cn/problems/find-a-value-of-a-mysterious-function-closest-to-target/)** [TAG]
 > 
 > 题意: TODO
 
 > [!TIP] **思路**
 > 
-> 可以部分参考 [898. 子数组按位或操作](https://leetcode-cn.com/problems/bitwise-ors-of-subarrays/)
+> 可以部分参考 [898. 子数组按位或操作](https://leetcode.cn/problems/bitwise-ors-of-subarrays/)
 > 
 > - 双指针 + 前缀和
 > 
@@ -546,7 +546,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1815. 得到新鲜甜甜圈的最多组数](https://leetcode-cn.com/problems/maximum-number-of-groups-getting-fresh-donuts/)** [TAG]
+> [!NOTE] **[LeetCode 1815. 得到新鲜甜甜圈的最多组数](https://leetcode.cn/problems/maximum-number-of-groups-getting-fresh-donuts/)** [TAG]
 > 
 > 题意: TODO
 
diff --git a/misc/string-dfs.md b/misc/string-dfs.md
index 0543630..322157a 100644
--- a/misc/string-dfs.md
+++ b/misc/string-dfs.md
@@ -18,7 +18,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 
-// https://leetcode-cn.com/problems/number-of-atoms/
+// https://leetcode.cn/problems/number-of-atoms/
 
 string s;
 int n;
@@ -83,7 +83,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 394. 字符串解码](https://leetcode-cn.com/problems/decode-string/)**
+> [!NOTE] **[LeetCode 394. 字符串解码](https://leetcode.cn/problems/decode-string/)**
 > 
 > 题意: TODO
 
@@ -216,7 +216,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 726. 原子的数量](https://leetcode-cn.com/problems/number-of-atoms/)**
+> [!NOTE] **[LeetCode 726. 原子的数量](https://leetcode.cn/problems/number-of-atoms/)**
 > 
 > 题意: TODO
 
@@ -295,7 +295,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 736. Lisp 语法解析](https://leetcode-cn.com/problems/parse-lisp-expression/)**
+> [!NOTE] **[LeetCode 736. Lisp 语法解析](https://leetcode.cn/problems/parse-lisp-expression/)**
 > 
 > 题意: TODO
 
diff --git a/misc/two-pointer.md b/misc/two-pointer.md
index 2ead5cc..21931f6 100644
--- a/misc/two-pointer.md
+++ b/misc/two-pointer.md
@@ -10,7 +10,7 @@
 
 如果不和其他数据结构结合使用，双指针维护区间信息的最简单模式就是维护具有一定单调性，新增和删去一个元素都很方便处理的信息，就比如正数的和、正整数的积等等。
 
-> [!NOTE] **例题 1 [leetcode 713. 乘积小于 K 的子数组](https://leetcode-cn.com/problems/subarray-product-less-than-k/)**
+> [!NOTE] **例题 1 [leetcode 713. 乘积小于 K 的子数组](https://leetcode.cn/problems/subarray-product-less-than-k/)**
 > 
 > 给定一个长度为 $n$ 的正整数数组 $\mathit{nums}$ 和整数 $k$, 找出该数组内乘积小于 $k$ 的连续子数组的个数。$1 \leq n \leq 3 \times 10^4, 1 \leq nums[i] \leq 1000, 0 \leq k \leq 10^6$
 
@@ -41,7 +41,7 @@ int numSubarrayProductLessThanK(vector<int>& nums, int k) {
 
 ## 子序列匹配
 
-> [!NOTE] **例题 3 [leetcode 524. 通过删除字母匹配到字典里最长单词](https://leetcode-cn.com/problems/longest-word-in-dictionary-through-deleting/)**
+> [!NOTE] **例题 3 [leetcode 524. 通过删除字母匹配到字典里最长单词](https://leetcode.cn/problems/longest-word-in-dictionary-through-deleting/)**
 > 
 > 给定一个字符串 $s$ 和一个字符串数组 $\mathit{dictionary}$ 作为字典，找出并返回字典中最长的字符串，该字符串可以通过删除 $s$ 中的某些字符得到。
 
@@ -74,7 +74,7 @@ string findLongestWord(string s, vector<string>& dictionary) {
 
 很多时候在序列上使用双指针之所以能够正确地达到目的，是因为序列的某些性质，最常见的就是利用序列的有序性。
 
-> [!NOTE] **例题 4 [leetcode 167. 两数之和 II - 输入有序数组](https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted/)**
+> [!NOTE] **例题 4 [leetcode 167. 两数之和 II - 输入有序数组](https://leetcode.cn/problems/two-sum-ii-input-array-is-sorted/)**
 > 
 > 给定一个已按照 **升序排列** 的整数数组 `numbers`，请你从数组中找出两个数满足相加之和等于目标数 `target`。
 
@@ -317,7 +317,7 @@ if __name__ == '__main__':
 
 * * *
 
-> [!NOTE] **[LeetCode 167. 两数之和 II - 输入有序数组](https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted/)**
+> [!NOTE] **[LeetCode 167. 两数之和 II - 输入有序数组](https://leetcode.cn/problems/two-sum-ii-input-array-is-sorted/)**
 > 
 > 题意: TODO
 
@@ -386,7 +386,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 611. 有效三角形的个数](https://leetcode-cn.com/problems/valid-triangle-number/)**
+> [!NOTE] **[LeetCode 611. 有效三角形的个数](https://leetcode.cn/problems/valid-triangle-number/)**
 > 
 > 题意: TODO
 
@@ -430,7 +430,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 633. 平方数之和](https://leetcode-cn.com/problems/sum-of-square-numbers/)**
+> [!NOTE] **[LeetCode 633. 平方数之和](https://leetcode.cn/problems/sum-of-square-numbers/)**
 > 
 > 题意: TODO
 
@@ -516,7 +516,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 719. 找出第 k 小的距离对](https://leetcode-cn.com/problems/find-k-th-smallest-pair-distance/)**
+> [!NOTE] **[LeetCode 719. 找出第 k 小的距离对](https://leetcode.cn/problems/find-k-th-smallest-pair-distance/)**
 > 
 > 题意: TODO
 
@@ -569,7 +569,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1213. 三个有序数组的交集](https://leetcode-cn.com/problems/intersection-of-three-sorted-arrays/)**
+> [!NOTE] **[LeetCode 1213. 三个有序数组的交集](https://leetcode.cn/problems/intersection-of-three-sorted-arrays/)**
 > 
 > 题意: TODO
 
@@ -659,7 +659,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1638. 统计只差一个字符的子串数目](https://leetcode-cn.com/problems/count-substrings-that-differ-by-one-character/)**
+> [!NOTE] **[LeetCode 1638. 统计只差一个字符的子串数目](https://leetcode.cn/problems/count-substrings-that-differ-by-one-character/)**
 > 
 > 题意: TODO
 
@@ -775,7 +775,7 @@ public:
 
 > 链表判环、找中点的快慢指针应用参见链表部分
 
-> [!NOTE] **[LeetCode 202. 快乐数](https://leetcode-cn.com/problems/happy-number/)**
+> [!NOTE] **[LeetCode 202. 快乐数](https://leetcode.cn/problems/happy-number/)**
 > 
 > 题意: TODO
 
@@ -852,7 +852,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 457. 环形数组循环](https://leetcode-cn.com/problems/circular-array-loop/)**
+> [!NOTE] **[LeetCode 457. 环形数组循环](https://leetcode.cn/problems/circular-array-loop/)**
 > 
 > 题意: TODO
 
@@ -919,7 +919,7 @@ public:
 
 ### 优化双指针
 
-> [!NOTE] **[LeetCode 15. 三数之和](https://leetcode-cn.com/problems/3sum/)**
+> [!NOTE] **[LeetCode 15. 三数之和](https://leetcode.cn/problems/3sum/)**
 > 
 > 题意: TODO
 
@@ -1020,7 +1020,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 16. 最接近的三数之和](https://leetcode-cn.com/problems/3sum-closest/)**
+> [!NOTE] **[LeetCode 16. 最接近的三数之和](https://leetcode.cn/problems/3sum-closest/)**
 > 
 > 题意: TODO
 
@@ -1086,7 +1086,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 18. 四数之和](https://leetcode-cn.com/problems/4sum/)**
+> [!NOTE] **[LeetCode 18. 四数之和](https://leetcode.cn/problems/4sum/)**
 > 
 > 题意: TODO
 
@@ -1162,7 +1162,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 786. 第 K 个最小的素数分数](https://leetcode-cn.com/problems/k-th-smallest-prime-fraction/)**
+> [!NOTE] **[LeetCode 786. 第 K 个最小的素数分数](https://leetcode.cn/problems/k-th-smallest-prime-fraction/)**
 > 
 > 题意: TODO
 
@@ -1226,7 +1226,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1610. 可见点的最大数目](https://leetcode-cn.com/problems/maximum-number-of-visible-points/)** [TAG]
+> [!NOTE] **[LeetCode 1610. 可见点的最大数目](https://leetcode.cn/problems/maximum-number-of-visible-points/)** [TAG]
 > 
 > 题意: TODO
 
@@ -1292,7 +1292,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1855. 下标对中的最大距离](https://leetcode-cn.com/problems/maximum-distance-between-a-pair-of-values/)**
+> [!NOTE] **[LeetCode 1855. 下标对中的最大距离](https://leetcode.cn/problems/maximum-distance-between-a-pair-of-values/)**
 > 
 > 题意: TODO
 
@@ -1597,7 +1597,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 11. 盛最多水的容器](https://leetcode-cn.com/problems/container-with-most-water/)**
+> [!NOTE] **[LeetCode 11. 盛最多水的容器](https://leetcode.cn/problems/container-with-most-water/)**
 > 
 > 题意: TODO
 
@@ -1657,7 +1657,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 532. 数组中的 k-diff 数对](https://leetcode-cn.com/problems/k-diff-pairs-in-an-array/)**
+> [!NOTE] **[LeetCode 532. 数组中的 k-diff 数对](https://leetcode.cn/problems/k-diff-pairs-in-an-array/)**
 > 
 > 题意: TODO
 
@@ -1727,7 +1727,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1537. 最大得分](https://leetcode-cn.com/problems/get-the-maximum-score/)**
+> [!NOTE] **[LeetCode 1537. 最大得分](https://leetcode.cn/problems/get-the-maximum-score/)**
 > 
 > 题意: TODO
 
@@ -1788,7 +1788,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1712. 将数组分成三个子数组的方案数](https://leetcode-cn.com/problems/ways-to-split-array-into-three-subarrays/)** [TAG]
+> [!NOTE] **[LeetCode 1712. 将数组分成三个子数组的方案数](https://leetcode.cn/problems/ways-to-split-array-into-three-subarrays/)** [TAG]
 > 
 > 题意: TODO
 
@@ -1870,7 +1870,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1793. 好子数组的最大分数](https://leetcode-cn.com/problems/maximum-score-of-a-good-subarray/)** [TAG]
+> [!NOTE] **[LeetCode 1793. 好子数组的最大分数](https://leetcode.cn/problems/maximum-score-of-a-good-subarray/)** [TAG]
 > 
 > 题意: TODO
 
diff --git a/search/basic.md b/search/basic.md
index e8bde30..8d16c89 100644
--- a/search/basic.md
+++ b/search/basic.md
@@ -6,13 +6,13 @@
 > 
 > 回溯时需特别注意 **恢复现场** 的相关实现
 > 
-> 如下面 [LeetCode LCP 58. 积木拼接](https://leetcode-cn.com/problems/De4qBB/) 一题中使用全局变量执行修改与回溯
+> 如下面 [LeetCode LCP 58. 积木拼接](https://leetcode.cn/problems/De4qBB/) 一题中使用全局变量执行修改与回溯
 > 
 > 但全局变量本身会在下一层递归中被再次修改，这样在上层递归中执行【恢复现场】时必然有问题。
 
 ### 构造
 
-> [!NOTE] **[LeetCode 22. 括号生成](https://leetcode-cn.com/problems/generate-parentheses/)**
+> [!NOTE] **[LeetCode 22. 括号生成](https://leetcode.cn/problems/generate-parentheses/)**
 > 
 > 题意: TODO
 
@@ -114,7 +114,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 95. 不同的二叉搜索树 II](https://leetcode-cn.com/problems/unique-binary-search-trees-ii/)**
+> [!NOTE] **[LeetCode 95. 不同的二叉搜索树 II](https://leetcode.cn/problems/unique-binary-search-trees-ii/)**
 > 
 > 题意: TODO
 
@@ -210,7 +210,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 96. 不同的二叉搜索树](https://leetcode-cn.com/problems/unique-binary-search-trees/)**
+> [!NOTE] **[LeetCode 96. 不同的二叉搜索树](https://leetcode.cn/problems/unique-binary-search-trees/)**
 > 
 > 题意: TODO
 
@@ -293,7 +293,7 @@ class Solution:
 
 ### 子集
 
-> [!NOTE] **[LeetCode 78. 子集](https://leetcode-cn.com/problems/subsets/)**
+> [!NOTE] **[LeetCode 78. 子集](https://leetcode.cn/problems/subsets/)**
 > 
 > 题意: TODO
 
@@ -383,7 +383,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 90. 子集 II](https://leetcode-cn.com/problems/subsets-ii/)**
+> [!NOTE] **[LeetCode 90. 子集 II](https://leetcode.cn/problems/subsets-ii/)**
 > 
 > 题意: TODO
 
@@ -451,7 +451,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 698. 划分为k个相等的子集](https://leetcode-cn.com/problems/partition-to-k-equal-sum-subsets/)**
+> [!NOTE] **[LeetCode 698. 划分为k个相等的子集](https://leetcode.cn/problems/partition-to-k-equal-sum-subsets/)**
 > 
 > 题意: TODO
 
@@ -555,7 +555,7 @@ class Solution:
 
 ### 排列
 
-> [!NOTE] **[LeetCode 46. 全排列](https://leetcode-cn.com/problems/permutations/)**
+> [!NOTE] **[LeetCode 46. 全排列](https://leetcode.cn/problems/permutations/)**
 > 
 > 题意: TODO
 
@@ -643,7 +643,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 47. 全排列 II](https://leetcode-cn.com/problems/permutations-ii/)**
+> [!NOTE] **[LeetCode 47. 全排列 II](https://leetcode.cn/problems/permutations-ii/)**
 > 
 > 题意: TODO
 
@@ -727,7 +727,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 784. 字母大小写全排列](https://leetcode-cn.com/problems/letter-case-permutation/)**
+> [!NOTE] **[LeetCode 784. 字母大小写全排列](https://leetcode.cn/problems/letter-case-permutation/)**
 > 
 > 题意: TODO
 
@@ -803,7 +803,7 @@ class Solution:
 
 ### 组合
 
-> [!NOTE] **[LeetCode 77. 组合](https://leetcode-cn.com/problems/combinations/)**
+> [!NOTE] **[LeetCode 77. 组合](https://leetcode.cn/problems/combinations/)**
 > 
 > 题意: TODO
 
@@ -874,7 +874,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 39. 组合总和](https://leetcode-cn.com/problems/combination-sum/)**
+> [!NOTE] **[LeetCode 39. 组合总和](https://leetcode.cn/problems/combination-sum/)**
 > 
 > 题意: TODO
 
@@ -999,13 +999,13 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 216. 组合总和 III](https://leetcode-cn.com/problems/combination-sum-iii/)**
+> [!NOTE] **[LeetCode 216. 组合总和 III](https://leetcode.cn/problems/combination-sum-iii/)**
 > 
 > 题意: TODO
 
 > [!TIP] **思路**
 >
-> 和  **[LeetCode 39. 组合总和](https://leetcode-cn.com/problems/combination-sum/)** 思路类似，不同点在于：
+> 和  **[LeetCode 39. 组合总和](https://leetcode.cn/problems/combination-sum/)** 思路类似，不同点在于：
 >
 > 1. 递归出口规则稍微有点不同：这道题要求每种组合的个数 == k
 > 2. 这道题不允许有重复数字，所以在进行本层递归的下一次添加数字，要从 u + 1 开始
@@ -1069,7 +1069,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 377. 组合总和 Ⅳ](https://leetcode-cn.com/problems/combination-sum-iv/)**
+> [!NOTE] **[LeetCode 377. 组合总和 Ⅳ](https://leetcode.cn/problems/combination-sum-iv/)**
 > 
 > 题意: TODO
 
@@ -1186,7 +1186,7 @@ class Solution:
 
 ### dfs 递归
 
-> [!NOTE] **[LeetCode 112. 路径总和](https://leetcode-cn.com/problems/path-sum/)**
+> [!NOTE] **[LeetCode 112. 路径总和](https://leetcode.cn/problems/path-sum/)**
 > 
 > 题意: TODO
 
@@ -1233,13 +1233,13 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 113. 路径总和 II](https://leetcode-cn.com/problems/path-sum-ii/)**
+> [!NOTE] **[LeetCode 113. 路径总和 II](https://leetcode.cn/problems/path-sum-ii/)**
 > 
 > 题意: TODO
 
 > [!TIP] **思路**
 > 
-> 这道题目和  **[LeetCode 112. 路径总和](https://leetcode-cn.com/problems/path-sum/)** 基本一样，不同点在于需要把**所有路径**记录下来。
+> 这道题目和  **[LeetCode 112. 路径总和](https://leetcode.cn/problems/path-sum/)** 基本一样，不同点在于需要把**所有路径**记录下来。
 
 <details>
 <summary>详细代码</summary>
@@ -1298,7 +1298,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 124. 二叉树中的最大路径和](https://leetcode-cn.com/problems/binary-tree-maximum-path-sum/)**
+> [!NOTE] **[LeetCode 124. 二叉树中的最大路径和](https://leetcode.cn/problems/binary-tree-maximum-path-sum/)**
 > 
 > 题意: TODO
 
@@ -1360,7 +1360,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 386. 字典序排数](https://leetcode-cn.com/problems/lexicographical-numbers/)**
+> [!NOTE] **[LeetCode 386. 字典序排数](https://leetcode.cn/problems/lexicographical-numbers/)**
 > 
 > 题意: TODO
 
@@ -1444,7 +1444,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1215. 步进数](https://leetcode-cn.com/problems/stepping-numbers/)**
+> [!NOTE] **[LeetCode 1215. 步进数](https://leetcode.cn/problems/stepping-numbers/)**
 > 
 > 题意: TODO
 
@@ -1528,7 +1528,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1273. 删除树节点](https://leetcode-cn.com/problems/delete-tree-nodes/)**
+> [!NOTE] **[LeetCode 1273. 删除树节点](https://leetcode.cn/problems/delete-tree-nodes/)**
 > 
 > 题意: TODO
 
@@ -1632,7 +1632,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1315. 祖父节点值为偶数的节点和](https://leetcode-cn.com/problems/sum-of-nodes-with-even-valued-grandparent/)**
+> [!NOTE] **[LeetCode 1315. 祖父节点值为偶数的节点和](https://leetcode.cn/problems/sum-of-nodes-with-even-valued-grandparent/)**
 > 
 > 题意: TODO
 
@@ -1733,7 +1733,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1415. 长度为 n 的开心字符串中字典序第 k 小的字符串](https://leetcode-cn.com/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/)**
+> [!NOTE] **[LeetCode 1415. 长度为 n 的开心字符串中字典序第 k 小的字符串](https://leetcode.cn/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/)**
 > 
 > 题意: TODO
 
@@ -1815,7 +1815,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1530. 好叶子节点对的数量](https://leetcode-cn.com/problems/number-of-good-leaf-nodes-pairs/)** [TAG]
+> [!NOTE] **[LeetCode 1530. 好叶子节点对的数量](https://leetcode.cn/problems/number-of-good-leaf-nodes-pairs/)** [TAG]
 > 
 > 题意: TODO
 
@@ -1897,7 +1897,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 2014. 重复 K 次的最长子序列](https://leetcode-cn.com/problems/longest-subsequence-repeated-k-times/)** [TAG]
+> [!NOTE] **[LeetCode 2014. 重复 K 次的最长子序列](https://leetcode.cn/problems/longest-subsequence-repeated-k-times/)** [TAG]
 > 
 > 题意: TODO
 
@@ -2173,7 +2173,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2056. 棋盘上有效移动组合的数目](https://leetcode-cn.com/problems/number-of-valid-move-combinations-on-chessboard/)** [TAG]
+> [!NOTE] **[LeetCode 2056. 棋盘上有效移动组合的数目](https://leetcode.cn/problems/number-of-valid-move-combinations-on-chessboard/)** [TAG]
 > 
 > 题意: TODO
 
@@ -2345,7 +2345,7 @@ public:
 
 ### dfs 回溯
 
-> [!NOTE] **[LeetCode 51. N 皇后](https://leetcode-cn.com/problems/n-queens/)**
+> [!NOTE] **[LeetCode 51. N 皇后](https://leetcode.cn/problems/n-queens/)**
 > 
 > 题意: TODO
 
@@ -2440,7 +2440,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 52. N皇后 II](https://leetcode-cn.com/problems/n-queens-ii/)**
+> [!NOTE] **[LeetCode 52. N皇后 II](https://leetcode.cn/problems/n-queens-ii/)**
 > 
 > 题意: TODO
 
@@ -2516,7 +2516,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 93. 复原 IP 地址](https://leetcode-cn.com/problems/restore-ip-addresses)**
+> [!NOTE] **[LeetCode 93. 复原 IP 地址](https://leetcode.cn/problems/restore-ip-addresses)**
 > 
 > 题意: TODO
 
@@ -2686,7 +2686,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 301. 删除无效的括号](https://leetcode-cn.com/problems/remove-invalid-parentheses/)**
+> [!NOTE] **[LeetCode 301. 删除无效的括号](https://leetcode.cn/problems/remove-invalid-parentheses/)**
 > 
 > 题意: TODO
 
@@ -2889,7 +2889,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 529. 扫雷游戏](https://leetcode-cn.com/problems/minesweeper/)**
+> [!NOTE] **[LeetCode 529. 扫雷游戏](https://leetcode.cn/problems/minesweeper/)**
 > 
 > 题意: TODO
 
@@ -3014,7 +3014,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 679. 24 点游戏](https://leetcode-cn.com/problems/24-game/)**
+> [!NOTE] **[LeetCode 679. 24 点游戏](https://leetcode.cn/problems/24-game/)**
 > 
 > 题意: TODO
 
@@ -3117,7 +3117,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1219. 黄金矿工](https://leetcode-cn.com/problems/path-with-maximum-gold/)** [TAG]
+> [!NOTE] **[LeetCode 1219. 黄金矿工](https://leetcode.cn/problems/path-with-maximum-gold/)** [TAG]
 > 
 > 题意: TODO
 
@@ -3203,7 +3203,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode LCP 58. 积木拼接](https://leetcode-cn.com/problems/De4qBB/)** [TAG]
+> [!NOTE] **[LeetCode LCP 58. 积木拼接](https://leetcode.cn/problems/De4qBB/)** [TAG]
 > 
 > 题意: TODO
 
@@ -3753,7 +3753,7 @@ int main() {
 
 ### 表达式类求解
 
-> [!NOTE] **[LeetCode 241. 为运算表达式设计优先级](https://leetcode-cn.com/problems/different-ways-to-add-parentheses/)**
+> [!NOTE] **[LeetCode 241. 为运算表达式设计优先级](https://leetcode.cn/problems/different-ways-to-add-parentheses/)**
 > 
 > 题意: TODO
 
@@ -3858,7 +3858,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 282. 给表达式添加运算符](https://leetcode-cn.com/problems/expression-add-operators/)**
+> [!NOTE] **[LeetCode 282. 给表达式添加运算符](https://leetcode.cn/problems/expression-add-operators/)**
 > 
 > 题意: TODO
 
@@ -3932,7 +3932,7 @@ public:
 
 ### 进阶
 
-> [!NOTE] **[LeetCode 126. 单词接龙 II](https://leetcode-cn.com/problems/word-ladder-ii/)**
+> [!NOTE] **[LeetCode 126. 单词接龙 II](https://leetcode.cn/problems/word-ladder-ii/)**
 > 
 > 题意: TODO
 
@@ -4022,7 +4022,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 127. 单词接龙](https://leetcode-cn.com/problems/word-ladder/)**
+> [!NOTE] **[LeetCode 127. 单词接龙](https://leetcode.cn/problems/word-ladder/)**
 > 
 > 题意: TODO
 
@@ -4079,7 +4079,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 139. 单词拆分](https://leetcode-cn.com/problems/word-break/)**
+> [!NOTE] **[LeetCode 139. 单词拆分](https://leetcode.cn/problems/word-break/)**
 > 
 > 题意: TODO
 
@@ -4170,7 +4170,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 140. 单词拆分 II](https://leetcode-cn.com/problems/word-break-ii/)**
+> [!NOTE] **[LeetCode 140. 单词拆分 II](https://leetcode.cn/problems/word-break-ii/)**
 > 
 > 题意: TODO
 
@@ -4314,7 +4314,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1900. 最佳运动员的比拼回合](https://leetcode-cn.com/problems/the-earliest-and-latest-rounds-where-players-compete/)**
+> [!NOTE] **[LeetCode 1900. 最佳运动员的比拼回合](https://leetcode.cn/problems/the-earliest-and-latest-rounds-where-players-compete/)**
 > 
 > 题意: TODO
 
diff --git a/search/heuristic.md b/search/heuristic.md
index 9292a9d..57e4e0b 100644
--- a/search/heuristic.md
+++ b/search/heuristic.md
@@ -408,7 +408,7 @@ int main() {
 * * *
 
 
-> [!NOTE] **[LeetCode 488. 祖玛游戏](https://leetcode-cn.com/problems/zuma-game/)**
+> [!NOTE] **[LeetCode 488. 祖玛游戏](https://leetcode.cn/problems/zuma-game/)**
 > 
 > 题意: TODO
 
diff --git a/search/opt.md b/search/opt.md
index 9d8fa9c..6321a1c 100644
--- a/search/opt.md
+++ b/search/opt.md
@@ -111,7 +111,7 @@
 
 ### 简单预处理优化
 
-> [!NOTE] **[LeetCode 131. 分割回文串](https://leetcode-cn.com/problems/palindrome-partitioning/)**
+> [!NOTE] **[LeetCode 131. 分割回文串](https://leetcode.cn/problems/palindrome-partitioning/)**
 > 
 > 题意: TODO
 
@@ -226,7 +226,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 132. 分割回文串 II](https://leetcode-cn.com/problems/palindrome-partitioning-ii/)**
+> [!NOTE] **[LeetCode 132. 分割回文串 II](https://leetcode.cn/problems/palindrome-partitioning-ii/)**
 > 
 > 题意: TODO
 
@@ -320,7 +320,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1278. 分割回文串 III](https://leetcode-cn.com/problems/palindrome-partitioning-iii/)**
+> [!NOTE] **[LeetCode 1278. 分割回文串 III](https://leetcode.cn/problems/palindrome-partitioning-iii/)**
 > 
 > 题意: TODO
 
@@ -380,7 +380,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1284. 转化为全零矩阵的最少反转次数](https://leetcode-cn.com/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/)** [TAG]
+> [!NOTE] **[LeetCode 1284. 转化为全零矩阵的最少反转次数](https://leetcode.cn/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/)** [TAG]
 > 
 > 题意: TODO
 
@@ -448,7 +448,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1307. 口算难题](https://leetcode-cn.com/problems/verbal-arithmetic-puzzle/)** [TAG]
+> [!NOTE] **[LeetCode 1307. 口算难题](https://leetcode.cn/problems/verbal-arithmetic-puzzle/)** [TAG]
 > 
 > 题意: TODO
 
@@ -1875,7 +1875,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 473. 火柴拼正方形](https://leetcode-cn.com/problems/matchsticks-to-square/)**
+> [!NOTE] **[LeetCode 473. 火柴拼正方形](https://leetcode.cn/problems/matchsticks-to-square/)**
 > 
 > 题意: TODO
 
@@ -1941,7 +1941,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 491. 递增子序列](https://leetcode-cn.com/problems/increasing-subsequences/)**
+> [!NOTE] **[LeetCode 491. 非递减子序列](https://leetcode.cn/problems/non-decreasing-subsequences/)**
 > 
 > 题意: TODO
 
diff --git a/string/hash.md b/string/hash.md
index b3ed528..fe21ed0 100644
--- a/string/hash.md
+++ b/string/hash.md
@@ -287,7 +287,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 648. 单词替换](https://leetcode-cn.com/problems/replace-words/)**
+> [!NOTE] **[LeetCode 648. 单词替换](https://leetcode.cn/problems/replace-words/)**
 > 
 > 题意: TODO
 
@@ -378,7 +378,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 796. 旋转字符串](https://leetcode-cn.com/problems/rotate-string/)**
+> [!NOTE] **[LeetCode 796. 旋转字符串](https://leetcode.cn/problems/rotate-string/)**
 > 
 > 题意: TODO
 
@@ -436,7 +436,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1147. 段式回文](https://leetcode-cn.com/problems/longest-chunked-palindrome-decomposition/) TAG**
+> [!NOTE] **[LeetCode 1147. 段式回文](https://leetcode.cn/problems/longest-chunked-palindrome-decomposition/) TAG**
 > 
 > 题意: TODO
 
@@ -503,7 +503,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1316. 不同的循环子字符串](https://leetcode-cn.com/problems/distinct-echo-substrings/)** [TAG]
+> [!NOTE] **[LeetCode 1316. 不同的循环子字符串](https://leetcode.cn/problems/distinct-echo-substrings/)** [TAG]
 > 
 > 题意: TODO
 
@@ -559,7 +559,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1392. 最长快乐前缀](https://leetcode-cn.com/problems/longest-happy-prefix/)** [TAG]
+> [!NOTE] **[LeetCode 1392. 最长快乐前缀](https://leetcode.cn/problems/longest-happy-prefix/)** [TAG]
 > 
 > 题意: 
 > 
@@ -787,7 +787,7 @@ public:
 
 ### 进阶
 
-> [!NOTE] **[LeetCode 2156. 查找给定哈希值的子串](https://leetcode-cn.com/problems/find-substring-with-given-hash-value/)** [TAG]
+> [!NOTE] **[LeetCode 2156. 查找给定哈希值的子串](https://leetcode.cn/problems/find-substring-with-given-hash-value/)** [TAG]
 > 
 > 题意: TODO
 
diff --git a/string/kmp.md b/string/kmp.md
index e36e823..7e26204 100644
--- a/string/kmp.md
+++ b/string/kmp.md
@@ -339,7 +339,7 @@ if __name__ == '__main__':
 
 * * *
 
-> [!NOTE] **[LeetCode 28. 实现 strStr()](https://leetcode-cn.com/problems/implement-strstr/)**
+> [!NOTE] **[LeetCode 28. 实现 strStr()](https://leetcode.cn/problems/implement-strstr/)**
 > 
 > 题意: TODO
 
@@ -468,7 +468,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 686. 重复叠加字符串匹配](https://leetcode-cn.com/problems/repeated-string-match/)**
+> [!NOTE] **[LeetCode 686. 重复叠加字符串匹配](https://leetcode.cn/problems/repeated-string-match/)**
 > 
 > 题意: TODO
 
@@ -845,7 +845,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 466. 统计重复个数](https://leetcode-cn.com/problems/count-the-repetitions/)**
+> [!NOTE] **[LeetCode 466. 统计重复个数](https://leetcode.cn/problems/count-the-repetitions/)**
 > 
 > 题意: TODO
 
@@ -1003,7 +1003,7 @@ int main() {
 
 ### 构造
 
-> [!NOTE] **[LeetCode 214. 最短回文串](https://leetcode-cn.com/problems/shortest-palindrome/)**
+> [!NOTE] **[LeetCode 214. 最短回文串](https://leetcode.cn/problems/shortest-palindrome/)**
 > 
 > 题意: TODO
 
diff --git a/string/lib-func.md b/string/lib-func.md
index 9b1cb8f..19e8588 100644
--- a/string/lib-func.md
+++ b/string/lib-func.md
@@ -111,7 +111,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1910. 删除一个字符串中所有出现的给定子字符串](https://leetcode-cn.com/problems/remove-all-occurrences-of-a-substring/)**
+> [!NOTE] **[LeetCode 1910. 删除一个字符串中所有出现的给定子字符串](https://leetcode.cn/problems/remove-all-occurrences-of-a-substring/)**
 > 
 > 题意: TODO
 
diff --git a/string/manacher.md b/string/manacher.md
index d34b3d2..98fed64 100644
--- a/string/manacher.md
+++ b/string/manacher.md
@@ -296,7 +296,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 5. 最长回文子串](https://leetcode-cn.com/problems/longest-palindromic-substring/)**
+> [!NOTE] **[LeetCode 5. 最长回文子串](https://leetcode.cn/problems/longest-palindromic-substring/)**
 > 
 > 题意: TODO
 
@@ -372,7 +372,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 647. 回文子串](https://leetcode-cn.com/problems/palindromic-substrings/)**
+> [!NOTE] **[LeetCode 647. 回文子串](https://leetcode.cn/problems/palindromic-substrings/)**
 > 
 > 题意: TODO
 
@@ -458,7 +458,7 @@ class Solution:
 
 ### 进阶
 
-> [!NOTE] **[LeetCode 1960. 两个回文子字符串长度的最大乘积](https://leetcode-cn.com/problems/maximum-product-of-the-length-of-two-palindromic-substrings/)**
+> [!NOTE] **[LeetCode 1960. 两个回文子字符串长度的最大乘积](https://leetcode.cn/problems/maximum-product-of-the-length-of-two-palindromic-substrings/)**
 > 
 > [Biweekly-58]()
 > 
diff --git a/string/minimal-string.md b/string/minimal-string.md
index 36446cb..6992c07 100644
--- a/string/minimal-string.md
+++ b/string/minimal-string.md
@@ -290,7 +290,7 @@ public:
 
 ### 最大表示法
 
-> [!NOTE] **[LeetCode 1163. 按字典序排在最后的子串](https://leetcode-cn.com/problems/last-substring-in-lexicographical-order/)**
+> [!NOTE] **[LeetCode 1163. 按字典序排在最后的子串](https://leetcode.cn/problems/last-substring-in-lexicographical-order/)**
 > 
 > 题意: TODO
 
diff --git a/string/sam.md b/string/sam.md
index df5fd55..070724d 100644
--- a/string/sam.md
+++ b/string/sam.md
@@ -632,7 +632,7 @@ $$
 
 ## 习题
 
-> [!NOTE] **[LeetCode 1923. 最长公共子路径](https://leetcode-cn.com/problems/longest-common-subpath/)**
+> [!NOTE] **[LeetCode 1923. 最长公共子路径](https://leetcode.cn/problems/longest-common-subpath/)**
 > 
 > 题意: TODO
 
diff --git a/string/trie.md b/string/trie.md
index 4919584..5987f4d 100644
--- a/string/trie.md
+++ b/string/trie.md
@@ -701,7 +701,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 208. 实现 Trie (前缀树)](https://leetcode-cn.com/problems/implement-trie-prefix-tree/)**
+> [!NOTE] **[LeetCode 208. 实现 Trie (前缀树)](https://leetcode.cn/problems/implement-trie-prefix-tree/)**
 > 
 > 题意: TODO
 
@@ -899,7 +899,7 @@ class Trie:
 
 * * *
 
-> [!NOTE] **[LeetCode 211. 添加与搜索单词 - 数据结构设计](https://leetcode-cn.com/problems/design-add-and-search-words-data-structure/)**
+> [!NOTE] **[LeetCode 211. 添加与搜索单词 - 数据结构设计](https://leetcode.cn/problems/design-add-and-search-words-data-structure/)**
 > 
 > 题意: TODO
 
@@ -1077,7 +1077,7 @@ class WordDictionary:
 
 * * *
 
-> [!NOTE] **[LeetCode 212. 单词搜索 II](https://leetcode-cn.com/problems/word-search-ii/)**
+> [!NOTE] **[LeetCode 212. 单词搜索 II](https://leetcode.cn/problems/word-search-ii/)**
 > 
 > 题意: TODO
 
@@ -1224,7 +1224,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 421. 数组中两个数的最大异或值](https://leetcode-cn.com/problems/maximum-xor-of-two-numbers-in-an-array/)**
+> [!NOTE] **[LeetCode 421. 数组中两个数的最大异或值](https://leetcode.cn/problems/maximum-xor-of-two-numbers-in-an-array/)**
 > 
 > 题意: TODO
 
@@ -1290,7 +1290,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 676. 实现一个魔法字典](https://leetcode-cn.com/problems/implement-magic-dictionary/)**
+> [!NOTE] **[LeetCode 676. 实现一个魔法字典](https://leetcode.cn/problems/implement-magic-dictionary/)**
 > 
 > 题意: TODO
 
@@ -1371,7 +1371,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 677. 键值映射](https://leetcode-cn.com/problems/map-sum-pairs/)**
+> [!NOTE] **[LeetCode 677. 键值映射](https://leetcode.cn/problems/map-sum-pairs/)**
 > 
 > 题意: TODO
 
@@ -1452,7 +1452,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 720. 词典中最长的单词](https://leetcode-cn.com/problems/longest-word-in-dictionary/)**
+> [!NOTE] **[LeetCode 720. 词典中最长的单词](https://leetcode.cn/problems/longest-word-in-dictionary/)**
 > 
 > 题意: TODO
 
@@ -1521,7 +1521,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2227. 加密解密字符串](https://leetcode-cn.com/problems/encrypt-and-decrypt-strings/)**
+> [!NOTE] **[LeetCode 2227. 加密解密字符串](https://leetcode.cn/problems/encrypt-and-decrypt-strings/)**
 > 
 > 题意: TODO
 
@@ -1759,7 +1759,7 @@ public:
 
 ### 进阶构造和使用
 
-> [!NOTE] **[LeetCode 745. 前缀和后缀搜索](https://leetcode-cn.com/problems/prefix-and-suffix-search/)**
+> [!NOTE] **[LeetCode 745. 前缀和后缀搜索](https://leetcode.cn/problems/prefix-and-suffix-search/)**
 > 
 > 题意: TODO
 
@@ -1841,7 +1841,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1268. 搜索推荐系统](https://leetcode-cn.com/problems/search-suggestions-system/)**
+> [!NOTE] **[LeetCode 1268. 搜索推荐系统](https://leetcode.cn/problems/search-suggestions-system/)**
 > 
 > 题意: TODO
 
@@ -1922,7 +1922,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1803. 统计异或值在范围内的数对有多少](https://leetcode-cn.com/problems/count-pairs-with-xor-in-a-range/)** [TAG]
+> [!NOTE] **[LeetCode 1803. 统计异或值在范围内的数对有多少](https://leetcode.cn/problems/count-pairs-with-xor-in-a-range/)** [TAG]
 > 
 > 题意: TODO
 
@@ -2118,7 +2118,7 @@ public:
 
 ### 离线 trie
 
-> [!NOTE] **[LeetCode 1707. 与数组中元素的最大异或值](https://leetcode-cn.com/problems/maximum-xor-with-an-element-from-array/)**
+> [!NOTE] **[LeetCode 1707. 与数组中元素的最大异或值](https://leetcode.cn/problems/maximum-xor-with-an-element-from-array/)**
 > 
 > [Weekly-210](https://github.com/OpenKikCoc/LeetCode/tree/master/Contest/2020-12-27_Weekly-221)
 > 
@@ -2207,7 +2207,7 @@ public:
 
 * * *
 
-> [!NOTE] **[AcWing 1938. 查询最大基因差](https://leetcode-cn.com/problems/maximum-genetic-difference-query/)**
+> [!NOTE] **[AcWing 1938. 查询最大基因差](https://leetcode.cn/problems/maximum-genetic-difference-query/)**
 > 
 > 题意: TODO
 
@@ -2335,7 +2335,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1707. 与数组中元素的最大异或值](https://leetcode-cn.com/problems/maximum-xor-with-an-element-from-array/)** [TAG]
+> [!NOTE] **[LeetCode 1707. 与数组中元素的最大异或值](https://leetcode.cn/problems/maximum-xor-with-an-element-from-array/)** [TAG]
 > 
 > 题意: TODO
 
@@ -2422,7 +2422,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1938. 查询最大基因差](https://leetcode-cn.com/problems/maximum-genetic-difference-query/)** [TAG]
+> [!NOTE] **[LeetCode 1938. 查询最大基因差](https://leetcode.cn/problems/maximum-genetic-difference-query/)** [TAG]
 > 
 > 题意: TODO
 
@@ -2820,7 +2820,7 @@ public:
 
 ### trie 动态拓展 + 树 hash
 
-> [!NOTE] **[LeetCode 1948. 删除系统中的重复文件夹](https://leetcode-cn.com/problems/delete-duplicate-folders-in-system/)**
+> [!NOTE] **[LeetCode 1948. 删除系统中的重复文件夹](https://leetcode.cn/problems/delete-duplicate-folders-in-system/)**
 > 
 > [weekly-251](https://github.com/OpenKikCoc/LeetCode/tree/master/Contest/2021-07-25_Weekly-251)
 > 
diff --git a/string/z-func.md b/string/z-func.md
index bd9623a..19d5106 100644
--- a/string/z-func.md
+++ b/string/z-func.md
@@ -154,7 +154,7 @@ def z_function(s):
 
 ## 习题
 
-> [!NOTE] **[LeetCode 2223. 构造字符串的总得分和](https://leetcode-cn.com/problems/sum-of-scores-of-built-strings/)**
+> [!NOTE] **[LeetCode 2223. 构造字符串的总得分和](https://leetcode.cn/problems/sum-of-scores-of-built-strings/)**
 > 
 > 题意: TODO
 
diff --git a/topic/bf-improve.md b/topic/bf-improve.md
index d481748..5032975 100644
--- a/topic/bf-improve.md
+++ b/topic/bf-improve.md
@@ -633,13 +633,13 @@ public:
 
 ### 双指针
 
-> [!NOTE] **[LeetCode 1521. 找到最接近目标值的函数值](https://leetcode-cn.com/problems/find-a-value-of-a-mysterious-function-closest-to-target/)** [TAG]
+> [!NOTE] **[LeetCode 1521. 找到最接近目标值的函数值](https://leetcode.cn/problems/find-a-value-of-a-mysterious-function-closest-to-target/)** [TAG]
 > 
 > 题意: TODO
 
 > [!TIP] **思路**
 > 
-> 可以部分参考 [898. 子数组按位或操作](https://leetcode-cn.com/problems/bitwise-ors-of-subarrays/)
+> 可以部分参考 [898. 子数组按位或操作](https://leetcode.cn/problems/bitwise-ors-of-subarrays/)
 > 
 > - 双指针 + 前缀和
 > 
diff --git a/topic/bracket.md b/topic/bracket.md
index a8611fc..f8a975c 100644
--- a/topic/bracket.md
+++ b/topic/bracket.md
@@ -93,7 +93,7 @@ bool next_balanced_sequence(string& s) {
 
 ## 习题
 
-> [!NOTE] **[LeetCode 678. 有效的括号字符串](https://leetcode-cn.com/problems/valid-parenthesis-string/)**
+> [!NOTE] **[LeetCode 678. 有效的括号字符串](https://leetcode.cn/problems/valid-parenthesis-string/)**
 > 
 > 题意: TODO
 
@@ -146,7 +146,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2116. 判断一个括号字符串是否有效](https://leetcode-cn.com/problems/check-if-a-parentheses-string-can-be-valid/)** [TAG]
+> [!NOTE] **[LeetCode 2116. 判断一个括号字符串是否有效](https://leetcode.cn/problems/check-if-a-parentheses-string-can-be-valid/)** [TAG]
 > 
 > 题意: TODO
 
@@ -200,7 +200,7 @@ class Solution {
 * * *
 
 
-> [!NOTE] **[LeetCode 761. 特殊的二进制序列](https://leetcode-cn.com/problems/special-binary-string/)**
+> [!NOTE] **[LeetCode 761. 特殊的二进制序列](https://leetcode.cn/problems/special-binary-string/)**
 > 
 > 题意: TODO
 
@@ -260,7 +260,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1963. 使字符串平衡的最小交换次数](https://leetcode-cn.com/problems/minimum-number-of-swaps-to-make-the-string-balanced/)**
+> [!NOTE] **[LeetCode 1963. 使字符串平衡的最小交换次数](https://leetcode.cn/problems/minimum-number-of-swaps-to-make-the-string-balanced/)**
 > 
 > 题意: TODO
 
diff --git a/topic/casebycase.md b/topic/casebycase.md
index b2f28dd..1f31304 100644
--- a/topic/casebycase.md
+++ b/topic/casebycase.md
@@ -92,7 +92,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 335. 路径交叉](https://leetcode-cn.com/problems/self-crossing/)**
+> [!NOTE] **[LeetCode 335. 路径交叉](https://leetcode.cn/problems/self-crossing/)**
 > 
 > 题意: TODO
 
@@ -146,7 +146,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 391. 完美矩形](https://leetcode-cn.com/problems/perfect-rectangle/)**
+> [!NOTE] **[LeetCode 391. 完美矩形](https://leetcode.cn/problems/perfect-rectangle/)**
 > 
 > 题意: TODO
 
@@ -223,7 +223,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 420. 强密码检验器](https://leetcode-cn.com/problems/strong-password-checker/)**
+> [!NOTE] **[LeetCode 420. 强密码检验器](https://leetcode.cn/problems/strong-password-checker/)**
 > 
 > 题意: TODO
 
@@ -312,7 +312,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2029. 石子游戏 IX](https://leetcode-cn.com/problems/stone-game-ix/)** [TAG]
+> [!NOTE] **[LeetCode 2029. 石子游戏 IX](https://leetcode.cn/problems/stone-game-ix/)** [TAG]
 > 
 > 题意: TODO
 
diff --git a/topic/data.md b/topic/data.md
index 2f5a6aa..4e1f074 100644
--- a/topic/data.md
+++ b/topic/data.md
@@ -1,6 +1,6 @@
 ## 习题
 
-> [!NOTE] **[LeetCode 1198. 找出所有行中最小公共元素](https://leetcode-cn.com/problems/find-smallest-common-element-in-all-rows/)**
+> [!NOTE] **[LeetCode 1198. 找出所有行中最小公共元素](https://leetcode.cn/problems/find-smallest-common-element-in-all-rows/)**
 > 
 > 题意: TODO
 
@@ -49,7 +49,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1326. 灌溉花园的最少水龙头数目](https://leetcode-cn.com/problems/minimum-number-of-taps-to-open-to-water-a-garden/)** [TAG]
+> [!NOTE] **[LeetCode 1326. 灌溉花园的最少水龙头数目](https://leetcode.cn/problems/minimum-number-of-taps-to-open-to-water-a-garden/)** [TAG]
 > 
 > 题意: TODO
 
@@ -172,7 +172,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1766. 互质树](https://leetcode-cn.com/problems/tree-of-coprimes/)** [TAG]
+> [!NOTE] **[LeetCode 1766. 互质树](https://leetcode.cn/problems/tree-of-coprimes/)** [TAG]
 > 
 > 题意: TODO
 
@@ -251,7 +251,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1906. 查询差绝对值的最小值](https://leetcode-cn.com/problems/minimum-absolute-difference-queries/)**
+> [!NOTE] **[LeetCode 1906. 查询差绝对值的最小值](https://leetcode.cn/problems/minimum-absolute-difference-queries/)**
 > 
 > 题意: TODO
 
@@ -315,7 +315,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1981. 最小化目标值与所选元素的差](https://leetcode-cn.com/problems/minimize-the-difference-between-target-and-chosen-elements/)**
+> [!NOTE] **[LeetCode 1981. 最小化目标值与所选元素的差](https://leetcode.cn/problems/minimize-the-difference-between-target-and-chosen-elements/)**
 > 
 > 题意: TODO
 
@@ -422,7 +422,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2188 完成比赛的最少时间](https://leetcode-cn.com/problems/minimum-time-to-finish-the-race/)**
+> [!NOTE] **[LeetCode 2188 完成比赛的最少时间](https://leetcode.cn/problems/minimum-time-to-finish-the-race/)**
 > 
 > 题意: TODO
 
diff --git a/topic/deduction.md b/topic/deduction.md
index 0c9ca4e..d336d70 100644
--- a/topic/deduction.md
+++ b/topic/deduction.md
@@ -185,7 +185,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 338. 比特位计数](https://leetcode-cn.com/problems/counting-bits/)**
+> [!NOTE] **[LeetCode 338. 比特位计数](https://leetcode.cn/problems/counting-bits/)**
 > 
 > 题意: TODO
 
@@ -261,7 +261,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 357. 计算各个位数不同的数字个数](https://leetcode-cn.com/problems/count-numbers-with-unique-digits/)**
+> [!NOTE] **[LeetCode 357. 计算各个位数不同的数字个数](https://leetcode.cn/problems/count-numbers-with-unique-digits/)**
 > 
 > 题意: TODO
 
@@ -330,7 +330,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 396. 旋转函数](https://leetcode-cn.com/problems/rotate-function/)**
+> [!NOTE] **[LeetCode 396. 旋转函数](https://leetcode.cn/problems/rotate-function/)**
 > 
 > 题意: TODO
 
diff --git a/topic/design.md b/topic/design.md
index afcacf1..3b92c75 100644
--- a/topic/design.md
+++ b/topic/design.md
@@ -2,7 +2,7 @@
 
 ### LRU LFU
 
-> [!NOTE] **[LeetCode 146. LRU缓存机制](https://leetcode-cn.com/problems/lru-cache/)**
+> [!NOTE] **[LeetCode 146. LRU缓存机制](https://leetcode.cn/problems/lru-cache/)**
 > 
 > 题意: TODO
 
@@ -235,7 +235,7 @@ class LRUCache:
 
 * * *
 
-> [!NOTE] **[LeetCode 460. LFU 缓存](https://leetcode-cn.com/problems/lfu-cache/)**
+> [!NOTE] **[LeetCode 460. LFU 缓存](https://leetcode.cn/problems/lfu-cache/)**
 > 
 > 题意: TODO
 
@@ -490,7 +490,7 @@ public:
 
 ### 数据结构
 
-> [!NOTE] **[LeetCode 284. 顶端迭代器](https://leetcode-cn.com/problems/peeking-iterator/)**
+> [!NOTE] **[LeetCode 284. 顶端迭代器](https://leetcode.cn/problems/peeking-iterator/)**
 > 
 > 题意: TODO
 
@@ -571,7 +571,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 341. 扁平化嵌套列表迭代器](https://leetcode-cn.com/problems/flatten-nested-list-iterator/)**
+> [!NOTE] **[LeetCode 341. 扁平化嵌套列表迭代器](https://leetcode.cn/problems/flatten-nested-list-iterator/)**
 > 
 > 题意: TODO
 
@@ -626,7 +626,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1286. 字母组合迭代器](https://leetcode-cn.com/problems/iterator-for-combination/)**
+> [!NOTE] **[LeetCode 1286. 字母组合迭代器](https://leetcode.cn/problems/iterator-for-combination/)**
 > 
 > 题意: TODO
 
@@ -683,7 +683,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 380. 常数时间插入、删除和获取随机元素](https://leetcode-cn.com/problems/insert-delete-getrandom-o1/)**
+> [!NOTE] **[LeetCode 380. 常数时间插入、删除和获取随机元素](https://leetcode.cn/problems/insert-delete-getrandom-o1/)**
 > 
 > 题意: TODO
 
@@ -812,7 +812,7 @@ func (this *RandomizedSet) GetRandom() int {
 
 * * *
 
-> [!NOTE] **[LeetCode 381. O(1) 时间插入、删除和获取随机元素 - 允许重复](https://leetcode-cn.com/problems/insert-delete-getrandom-o1-duplicates-allowed/)**
+> [!NOTE] **[LeetCode 381. O(1) 时间插入、删除和获取随机元素 - 允许重复](https://leetcode.cn/problems/insert-delete-getrandom-o1-duplicates-allowed/)**
 > 
 > 题意: TODO
 
@@ -887,7 +887,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 382. 链表随机节点](https://leetcode-cn.com/problems/linked-list-random-node/)**
+> [!NOTE] **[LeetCode 382. 链表随机节点](https://leetcode.cn/problems/linked-list-random-node/)**
 > 
 > 题意: TODO
 
@@ -950,7 +950,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 432. 全 O(1) 的数据结构](https://leetcode-cn.com/problems/all-oone-data-structure/)**
+> [!NOTE] **[LeetCode 432. 全 O(1) 的数据结构](https://leetcode.cn/problems/all-oone-data-structure/)**
 > 
 > 题意: TODO
 
@@ -1216,7 +1216,7 @@ func (this *AllOne) GetMinKey() string {
 
 * * *
 
-> [!NOTE] **[LeetCode 622. 设计循环队列](https://leetcode-cn.com/problems/design-circular-queue/)**
+> [!NOTE] **[LeetCode 622. 设计循环队列](https://leetcode.cn/problems/design-circular-queue/)**
 > 
 > 题意: TODO
 
@@ -1375,7 +1375,7 @@ class MyCircularQueue:
 
 * * *
 
-> [!NOTE] **[LeetCode 641. 设计循环双端队列](https://leetcode-cn.com/problems/design-circular-deque/)**
+> [!NOTE] **[LeetCode 641. 设计循环双端队列](https://leetcode.cn/problems/design-circular-deque/)**
 > 
 > 题意: TODO
 
@@ -1484,7 +1484,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 705. 设计哈希集合](https://leetcode-cn.com/problems/design-hashset/)**
+> [!NOTE] **[LeetCode 705. 设计哈希集合](https://leetcode.cn/problems/design-hashset/)**
 > 
 > 题意: TODO
 
@@ -1559,7 +1559,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 706. 设计哈希映射](https://leetcode-cn.com/problems/design-hashmap/)**
+> [!NOTE] **[LeetCode 706. 设计哈希映射](https://leetcode.cn/problems/design-hashmap/)**
 > 
 > 题意: TODO
 
@@ -1639,7 +1639,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 707. 设计链表](https://leetcode-cn.com/problems/design-linked-list/)**
+> [!NOTE] **[LeetCode 707. 设计链表](https://leetcode.cn/problems/design-linked-list/)**
 > 
 > 题意: TODO
 
@@ -1749,7 +1749,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1146. 快照数组](https://leetcode-cn.com/problems/snapshot-array/)**
+> [!NOTE] **[LeetCode 1146. 快照数组](https://leetcode.cn/problems/snapshot-array/)**
 > 
 > 题意: TODO
 
@@ -1819,7 +1819,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1166. 设计文件系统](https://leetcode-cn.com/problems/design-file-system/)**
+> [!NOTE] **[LeetCode 1166. 设计文件系统](https://leetcode.cn/problems/design-file-system/)**
 > 
 > 题意: TODO
 
@@ -1877,7 +1877,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1172. 餐盘栈](https://leetcode-cn.com/problems/dinner-plate-stacks/)** [TAG]
+> [!NOTE] **[LeetCode 1172. 餐盘栈](https://leetcode.cn/problems/dinner-plate-stacks/)** [TAG]
 > 
 > 题意: TODO
 
@@ -1998,7 +1998,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1348. 推文计数](https://leetcode-cn.com/problems/tweet-counts-per-frequency/)**
+> [!NOTE] **[LeetCode 1348. 推文计数](https://leetcode.cn/problems/tweet-counts-per-frequency/)**
 > 
 > 题意: TODO
 
@@ -2051,7 +2051,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1670. 设计前中后队列](https://leetcode-cn.com/problems/design-front-middle-back-queue/)**
+> [!NOTE] **[LeetCode 1670. 设计前中后队列](https://leetcode.cn/problems/design-front-middle-back-queue/)**
 > 
 > 题意: TODO
 
@@ -2224,7 +2224,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2034. 股票价格波动](https://leetcode-cn.com/problems/stock-price-fluctuation/)**
+> [!NOTE] **[LeetCode 2034. 股票价格波动](https://leetcode.cn/problems/stock-price-fluctuation/)**
 > 
 > 题意: TODO
 
@@ -2340,7 +2340,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 优惠活动系统](https://leetcode-cn.com/contest/cnunionpay-2022spring/problems/kDPV0f/)**
+> [!NOTE] **[LeetCode 优惠活动系统](https://leetcode.cn/contest/cnunionpay-2022spring/problems/kDPV0f/)**
 > 
 > 题意: TODO
 
@@ -2423,7 +2423,7 @@ public:
 
 ### 四叉树
 
-> [!NOTE] **[LeetCode 427. 建立四叉树](https://leetcode-cn.com/problems/construct-quad-tree/)**
+> [!NOTE] **[LeetCode 427. 建立四叉树](https://leetcode.cn/problems/construct-quad-tree/)**
 > 
 > 题意: TODO
 
@@ -2478,7 +2478,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 558. 四叉树交集](https://leetcode-cn.com/problems/logical-or-of-two-binary-grids-represented-as-quad-trees/)**
+> [!NOTE] **[LeetCode 558. 四叉树交集](https://leetcode.cn/problems/logical-or-of-two-binary-grids-represented-as-quad-trees/)**
 > 
 > 题意: TODO
 
@@ -2572,7 +2572,7 @@ public:
 
 ### 随机化
 
-> [!NOTE] **[LeetCode 384. 打乱数组](https://leetcode-cn.com/problems/shuffle-an-array/)**
+> [!NOTE] **[LeetCode 384. 打乱数组](https://leetcode.cn/problems/shuffle-an-array/)**
 > 
 > 题意: TODO
 
@@ -2694,7 +2694,7 @@ public:
 
 ### 系统设计
 
-> [!NOTE] **[LeetCode 355. 设计推特](https://leetcode-cn.com/problems/design-twitter/)**
+> [!NOTE] **[LeetCode 355. 设计推特](https://leetcode.cn/problems/design-twitter/)**
 > 
 > 题意: TODO
 
@@ -2791,7 +2791,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 385. 迷你语法分析器](https://leetcode-cn.com/problems/mini-parser/)**
+> [!NOTE] **[LeetCode 385. 迷你语法分析器](https://leetcode.cn/problems/mini-parser/)**
 > 
 > 题意: TODO
 
@@ -2874,7 +2874,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 535. TinyURL 的加密与解密](https://leetcode-cn.com/problems/encode-and-decode-tinyurl/)**
+> [!NOTE] **[LeetCode 535. TinyURL 的加密与解密](https://leetcode.cn/problems/encode-and-decode-tinyurl/)**
 > 
 > 题意: TODO
 
@@ -2936,7 +2936,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1396. 设计地铁系统](https://leetcode-cn.com/problems/design-underground-system/)**
+> [!NOTE] **[LeetCode 1396. 设计地铁系统](https://leetcode.cn/problems/design-underground-system/)**
 > 
 > 题意: TODO
 
@@ -2995,7 +2995,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1472. 设计浏览器历史记录](https://leetcode-cn.com/problems/design-browser-history/)**
+> [!NOTE] **[LeetCode 1472. 设计浏览器历史记录](https://leetcode.cn/problems/design-browser-history/)**
 > 
 > 题意: TODO
 
@@ -3093,7 +3093,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1912. 设计电影租借系统](https://leetcode-cn.com/problems/design-movie-rental-system/)**
+> [!NOTE] **[LeetCode 1912. 设计电影租借系统](https://leetcode.cn/problems/design-movie-rental-system/)**
 > 
 > 题意: TODO
 
diff --git a/topic/dloop.md b/topic/dloop.md
index 61c44e4..daf2d99 100644
--- a/topic/dloop.md
+++ b/topic/dloop.md
@@ -13,7 +13,7 @@
 ## 习题
 
 
-> [!NOTE] **[LeetCode 765. 情侣牵手](https://leetcode-cn.com/problems/couples-holding-hands/)**
+> [!NOTE] **[LeetCode 765. 情侣牵手](https://leetcode.cn/problems/couples-holding-hands/)**
 > 
 > 题意: TODO
 
diff --git a/topic/left-right.md b/topic/left-right.md
index 5c94b49..4558934 100644
--- a/topic/left-right.md
+++ b/topic/left-right.md
@@ -1,6 +1,6 @@
 ## 习题
 
-> [!NOTE] **[LeetCode 1156. 单字符重复子串的最大长度](https://leetcode-cn.com/problems/swap-for-longest-repeated-character-substring/)** [TAG]
+> [!NOTE] **[LeetCode 1156. 单字符重复子串的最大长度](https://leetcode.cn/problems/swap-for-longest-repeated-character-substring/)** [TAG]
 > 
 > 题意: TODO
 
@@ -72,7 +72,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1186. 删除一次得到子数组最大和](https://leetcode-cn.com/problems/maximum-subarray-sum-with-one-deletion/)**
+> [!NOTE] **[LeetCode 1186. 删除一次得到子数组最大和](https://leetcode.cn/problems/maximum-subarray-sum-with-one-deletion/)**
 > 
 > 题意: TODO
 
@@ -129,7 +129,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1856. 子数组最小乘积的最大值](https://leetcode-cn.com/problems/maximum-subarray-min-product/)**
+> [!NOTE] **[LeetCode 1856. 子数组最小乘积的最大值](https://leetcode.cn/problems/maximum-subarray-min-product/)**
 > 
 > 题意: TODO
 
@@ -308,7 +308,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1960. 两个回文子字符串长度的最大乘积](https://leetcode-cn.com/problems/maximum-product-of-the-length-of-two-palindromic-substrings/)** [TAG]
+> [!NOTE] **[LeetCode 1960. 两个回文子字符串长度的最大乘积](https://leetcode.cn/problems/maximum-product-of-the-length-of-two-palindromic-substrings/)** [TAG]
 > 
 > 题意: TODO
 
@@ -395,7 +395,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2054. 两个最好的不重叠活动](https://leetcode-cn.com/problems/two-best-non-overlapping-events/)**
+> [!NOTE] **[LeetCode 2054. 两个最好的不重叠活动](https://leetcode.cn/problems/two-best-non-overlapping-events/)**
 > 
 > 题意: TODO
 
@@ -511,7 +511,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2163. 删除元素后和的最小差值](https://leetcode-cn.com/problems/minimum-difference-in-sums-after-removal-of-elements/)** [TAG]
+> [!NOTE] **[LeetCode 2163. 删除元素后和的最小差值](https://leetcode.cn/problems/minimum-difference-in-sums-after-removal-of-elements/)** [TAG]
 > 
 > 题意: TODO
 
@@ -582,7 +582,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2167. 移除所有载有违禁货物车厢所需的最少时间](https://leetcode-cn.com/problems/minimum-time-to-remove-all-cars-containing-illegal-goods/)** [TAG]
+> [!NOTE] **[LeetCode 2167. 移除所有载有违禁货物车厢所需的最少时间](https://leetcode.cn/problems/minimum-time-to-remove-all-cars-containing-illegal-goods/)** [TAG]
 > 
 > 题意: TODO
 
@@ -1278,7 +1278,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1930. 长度为 3 的不同回文子序列](https://leetcode-cn.com/problems/unique-length-3-palindromic-subsequences/)**
+> [!NOTE] **[LeetCode 1930. 长度为 3 的不同回文子序列](https://leetcode.cn/problems/unique-length-3-palindromic-subsequences/)**
 > 
 > 题意: TODO
 
diff --git a/topic/prepare.md b/topic/prepare.md
index 9eeac88..f7e9350 100644
--- a/topic/prepare.md
+++ b/topic/prepare.md
@@ -1,6 +1,6 @@
 ## 习题
 
-> [!NOTE] **[LeetCode 336. 回文对](https://leetcode-cn.com/problems/palindrome-pairs/)**
+> [!NOTE] **[LeetCode 336. 回文对](https://leetcode.cn/problems/palindrome-pairs/)**
 > 
 > 题意: TODO
 
diff --git a/topic/range.md b/topic/range.md
index 05a5434..632f4c0 100644
--- a/topic/range.md
+++ b/topic/range.md
@@ -1,6 +1,6 @@
 ## 习题
 
-> [!NOTE] **[LeetCode 795. 区间子数组个数](https://leetcode-cn.com/problems/number-of-subarrays-with-bounded-maximum/)**
+> [!NOTE] **[LeetCode 795. 区间子数组个数](https://leetcode.cn/problems/number-of-subarrays-with-bounded-maximum/)**
 > 
 > 题意: TODO
 
diff --git a/topic/rmq.md b/topic/rmq.md
index 03a94dc..ef70e47 100644
--- a/topic/rmq.md
+++ b/topic/rmq.md
@@ -328,7 +328,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 654. 最大二叉树](https://leetcode-cn.com/problems/maximum-binary-tree/)**
+> [!NOTE] **[LeetCode 654. 最大二叉树](https://leetcode.cn/problems/maximum-binary-tree/)**
 > 
 > 题意: TODO
 
diff --git a/topic/simulation.md b/topic/simulation.md
index 2c3ccbe..a358ce5 100644
--- a/topic/simulation.md
+++ b/topic/simulation.md
@@ -177,7 +177,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1154. 一年中的第几天](https://leetcode-cn.com/problems/day-of-the-year/)**
+> [!NOTE] **[LeetCode 1154. 一年中的第几天](https://leetcode.cn/problems/day-of-the-year/)**
 > 
 > 题意: TODO
 
@@ -247,7 +247,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1185. 一周中的第几天](https://leetcode-cn.com/problems/day-of-the-week/)**
+> [!NOTE] **[LeetCode 1185. 一周中的第几天](https://leetcode.cn/problems/day-of-the-week/)**
 > 
 > 题意: TODO
 
@@ -297,7 +297,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1360. 日期之间隔几天](https://leetcode-cn.com/problems/number-of-days-between-two-dates/)** [TAG]
+> [!NOTE] **[LeetCode 1360. 日期之间隔几天](https://leetcode.cn/problems/number-of-days-between-two-dates/)** [TAG]
 > 
 > 题意: TODO
 
@@ -790,7 +790,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 592. 分数加减运算](https://leetcode-cn.com/problems/fraction-addition-and-subtraction/)**
+> [!NOTE] **[LeetCode 592. 分数加减运算](https://leetcode.cn/problems/fraction-addition-and-subtraction/)**
 > 
 > 题意: TODO
 
@@ -847,7 +847,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 68. 文本左右对齐](https://leetcode-cn.com/problems/text-justification/)**
+> [!NOTE] **[LeetCode 68. 文本左右对齐](https://leetcode.cn/problems/text-justification/)**
 > 
 > 题意: TODO
 
@@ -920,7 +920,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 71. 简化路径](https://leetcode-cn.com/problems/simplify-path/)**
+> [!NOTE] **[LeetCode 71. 简化路径](https://leetcode.cn/problems/simplify-path/)**
 > 
 > 题意: TODO
 
@@ -991,7 +991,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 80. 删除排序数组中的重复项 II](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array-ii/)**
+> [!NOTE] **[LeetCode 80. 删除排序数组中的重复项 II](https://leetcode.cn/problems/remove-duplicates-from-sorted-array-ii/)**
 > 
 > 题意: TODO
 
@@ -1043,7 +1043,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 149. 直线上最多的点数](https://leetcode-cn.com/problems/max-points-on-a-line/)**
+> [!NOTE] **[LeetCode 149. 直线上最多的点数](https://leetcode.cn/problems/max-points-on-a-line/)**
 > 
 > 题意: TODO
 
@@ -1166,7 +1166,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 290. 单词规律](https://leetcode-cn.com/problems/word-pattern/)**
+> [!NOTE] **[LeetCode 290. 单词规律](https://leetcode.cn/problems/word-pattern/)**
 > 
 > 题意: TODO
 
@@ -1217,7 +1217,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 498. 对角线遍历](https://leetcode-cn.com/problems/diagonal-traverse/)**
+> [!NOTE] **[LeetCode 498. 对角线遍历](https://leetcode.cn/problems/diagonal-traverse/)**
 > 
 > 题意: TODO
 
@@ -1264,7 +1264,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 649. Dota2 参议院](https://leetcode-cn.com/problems/dota2-senate/)**
+> [!NOTE] **[LeetCode 649. Dota2 参议院](https://leetcode.cn/problems/dota2-senate/)**
 > 
 > 题意: TODO
 
@@ -1351,7 +1351,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 721. 账户合并](https://leetcode-cn.com/problems/accounts-merge/)**
+> [!NOTE] **[LeetCode 721. 账户合并](https://leetcode.cn/problems/accounts-merge/)**
 > 
 > 题意: TODO
 
@@ -1415,7 +1415,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 794. 有效的井字游戏](https://leetcode-cn.com/problems/valid-tic-tac-toe-state/)**
+> [!NOTE] **[LeetCode 794. 有效的井字游戏](https://leetcode.cn/problems/valid-tic-tac-toe-state/)**
 > 
 > 题意: TODO
 
@@ -1479,7 +1479,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1152. 用户网站访问行为分析](https://leetcode-cn.com/problems/analyze-user-website-visit-pattern/)**
+> [!NOTE] **[LeetCode 1152. 用户网站访问行为分析](https://leetcode.cn/problems/analyze-user-website-visit-pattern/)**
 > 
 > 题意: TODO
 
@@ -1558,7 +1558,7 @@ public:
 * * *
 
 
-> [!NOTE] **[LeetCode 1153. 字符串转化](https://leetcode-cn.com/problems/string-transforms-into-another-string/)** TAG
+> [!NOTE] **[LeetCode 1153. 字符串转化](https://leetcode.cn/problems/string-transforms-into-another-string/)** TAG
 > 
 > 题意: 注意：原题要求转化为以下条件
 > 
@@ -1648,7 +1648,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1409. 查询带键的排列](https://leetcode-cn.com/problems/queries-on-a-permutation-with-key/)**
+> [!NOTE] **[LeetCode 1409. 查询带键的排列](https://leetcode.cn/problems/queries-on-a-permutation-with-key/)**
 > 
 > 题意: TODO
 
@@ -1705,7 +1705,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1932. 合并多棵二叉搜索树](https://leetcode-cn.com/problems/merge-bsts-to-create-single-bst/)** [TAG]
+> [!NOTE] **[LeetCode 1932. 合并多棵二叉搜索树](https://leetcode.cn/problems/merge-bsts-to-create-single-bst/)** [TAG]
 > 
 > 题意: TODO
 
@@ -1821,7 +1821,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1958. 检查操作是否合法](https://leetcode-cn.com/problems/check-if-move-is-legal/)**
+> [!NOTE] **[LeetCode 1958. 检查操作是否合法](https://leetcode.cn/problems/check-if-move-is-legal/)**
 > 
 > 题意: TODO
 
@@ -1914,7 +1914,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2018. 判断单词是否能放入填字游戏内](https://leetcode-cn.com/problems/check-if-word-can-be-placed-in-crossword/)**
+> [!NOTE] **[LeetCode 2018. 判断单词是否能放入填字游戏内](https://leetcode.cn/problems/check-if-word-can-be-placed-in-crossword/)**
 > 
 > 题意: TODO
 
@@ -2206,7 +2206,7 @@ public:
 
 ### 字符串处理
 
-> [!NOTE] **[LeetCode 388. 文件的最长绝对路径](https://leetcode-cn.com/problems/longest-absolute-file-path/)**
+> [!NOTE] **[LeetCode 388. 文件的最长绝对路径](https://leetcode.cn/problems/longest-absolute-file-path/)**
 > 
 > 题意: TODO
 
@@ -2256,7 +2256,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 393. UTF-8 编码验证](https://leetcode-cn.com/problems/utf-8-validation/)**
+> [!NOTE] **[LeetCode 393. UTF-8 编码验证](https://leetcode.cn/problems/utf-8-validation/)**
 > 
 > 题意: TODO
 
@@ -2310,7 +2310,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 443. 压缩字符串](https://leetcode-cn.com/problems/string-compression/)**
+> [!NOTE] **[LeetCode 443. 压缩字符串](https://leetcode.cn/problems/string-compression/)**
 > 
 > 题意: TODO
 
@@ -2392,7 +2392,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 467. 环绕字符串中唯一的子字符串](https://leetcode-cn.com/problems/unique-substrings-in-wraparound-string/)**
+> [!NOTE] **[LeetCode 467. 环绕字符串中唯一的子字符串](https://leetcode.cn/problems/unique-substrings-in-wraparound-string/)**
 > 
 > 题意: TODO
 
@@ -2438,7 +2438,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 468. 验证IP地址](https://leetcode-cn.com/problems/validate-ip-address/)**
+> [!NOTE] **[LeetCode 468. 验证IP地址](https://leetcode.cn/problems/validate-ip-address/)**
 > 
 > 题意: TODO
 
@@ -2521,7 +2521,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 605. 种花问题](https://leetcode-cn.com/problems/can-place-flowers/)**
+> [!NOTE] **[LeetCode 605. 种花问题](https://leetcode.cn/problems/can-place-flowers/)**
 > 
 > 题意: TODO
 
@@ -2589,7 +2589,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 640. 求解方程](https://leetcode-cn.com/problems/solve-the-equation/)**
+> [!NOTE] **[LeetCode 640. 求解方程](https://leetcode.cn/problems/solve-the-equation/)**
 > 
 > 题意: TODO
 
@@ -2655,7 +2655,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 722. 删除注释](https://leetcode-cn.com/problems/remove-comments/)**
+> [!NOTE] **[LeetCode 722. 删除注释](https://leetcode.cn/problems/remove-comments/)**
 > 
 > 题意: TODO
 
@@ -2715,7 +2715,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 767. 重构字符串](https://leetcode-cn.com/problems/reorganize-string/)**
+> [!NOTE] **[LeetCode 767. 重构字符串](https://leetcode.cn/problems/reorganize-string/)**
 > 
 > 题意: TODO
 
@@ -2808,7 +2808,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1169. 查询无效交易](https://leetcode-cn.com/problems/invalid-transactions/)**
+> [!NOTE] **[LeetCode 1169. 查询无效交易](https://leetcode.cn/problems/invalid-transactions/)**
 > 
 > 题意: TODO
 
@@ -2882,7 +2882,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1209. 删除字符串中的所有相邻重复项 II](https://leetcode-cn.com/problems/remove-all-adjacent-duplicates-in-string-ii/)**
+> [!NOTE] **[LeetCode 1209. 删除字符串中的所有相邻重复项 II](https://leetcode.cn/problems/remove-all-adjacent-duplicates-in-string-ii/)**
 > 
 > 题意: TODO
 
@@ -2982,7 +2982,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1410. HTML 实体解析器](https://leetcode-cn.com/problems/html-entity-parser/)**
+> [!NOTE] **[LeetCode 1410. HTML 实体解析器](https://leetcode.cn/problems/html-entity-parser/)**
 > 
 > 题意: TODO
 
@@ -3096,7 +3096,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1432. 改变一个整数能得到的最大差值](https://leetcode-cn.com/problems/max-difference-you-can-get-from-changing-an-integer/)**
+> [!NOTE] **[LeetCode 1432. 改变一个整数能得到的最大差值](https://leetcode.cn/problems/max-difference-you-can-get-from-changing-an-integer/)**
 > 
 > 题意: TODO
 
@@ -3162,7 +3162,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1839. 所有元音按顺序排布的最长子字符串](https://leetcode-cn.com/problems/longest-substring-of-all-vowels-in-order/)**
+> [!NOTE] **[LeetCode 1839. 所有元音按顺序排布的最长子字符串](https://leetcode.cn/problems/longest-substring-of-all-vowels-in-order/)**
 > 
 > 题意: TODO
 
@@ -3284,7 +3284,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1849. 将字符串拆分为递减的连续值](https://leetcode-cn.com/problems/splitting-a-string-into-descending-consecutive-values/)**
+> [!NOTE] **[LeetCode 1849. 将字符串拆分为递减的连续值](https://leetcode.cn/problems/splitting-a-string-into-descending-consecutive-values/)**
 > 
 > 题意: TODO
 
@@ -3480,7 +3480,7 @@ public:
 
 ### 丑数
 
-> [!NOTE] **[LeetCode 263. 丑数](https://leetcode-cn.com/problems/ugly-number/)**
+> [!NOTE] **[LeetCode 263. 丑数](https://leetcode.cn/problems/ugly-number/)**
 > 
 > 题意: TODO
 
@@ -3528,7 +3528,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 264. 丑数 II](https://leetcode-cn.com/problems/ugly-number-ii/)**
+> [!NOTE] **[LeetCode 264. 丑数 II](https://leetcode.cn/problems/ugly-number-ii/)**
 > 
 > 题意: TODO
 
@@ -3583,7 +3583,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 313. 超级丑数](https://leetcode-cn.com/problems/super-ugly-number/)**
+> [!NOTE] **[LeetCode 313. 超级丑数](https://leetcode.cn/problems/super-ugly-number/)**
 > 
 > 题意: TODO
 
@@ -3986,7 +3986,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 1138. 字母板上的路径](https://leetcode-cn.com/problems/alphabet-board-path/)**
+> [!NOTE] **[LeetCode 1138. 字母板上的路径](https://leetcode.cn/problems/alphabet-board-path/)**
 > 
 > 题意: TODO
 
@@ -4121,7 +4121,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1887. 使数组元素相等的减少操作次数](https://leetcode-cn.com/problems/reduction-operations-to-make-the-array-elements-equal/)**
+> [!NOTE] **[LeetCode 1887. 使数组元素相等的减少操作次数](https://leetcode.cn/problems/reduction-operations-to-make-the-array-elements-equal/)**
 > 
 > 题意: TODO
 
@@ -4559,7 +4559,7 @@ public:
 
 ### STL 简化模拟
 
-> [!NOTE] **[LeetCode 2122. 还原原数组](https://leetcode-cn.com/problems/recover-the-original-array/)** [TAG]
+> [!NOTE] **[LeetCode 2122. 还原原数组](https://leetcode.cn/problems/recover-the-original-array/)** [TAG]
 > 
 > 题意: TODO
 
@@ -4623,7 +4623,7 @@ public:
 
 ### 数字相关
 
-> [!NOTE] **[LeetCode 7. 整数反转](https://leetcode-cn.com/problems/reverse-integer/)**
+> [!NOTE] **[LeetCode 7. 整数反转](https://leetcode.cn/problems/reverse-integer/)**
 > 
 > 题意: TODO
 
@@ -4706,7 +4706,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 8. 字符串转换整数 (atoi)](https://leetcode-cn.com/problems/string-to-integer-atoi/)**
+> [!NOTE] **[LeetCode 8. 字符串转换整数 (atoi)](https://leetcode.cn/problems/string-to-integer-atoi/)**
 > 
 > 题意: TODO
 
@@ -4787,7 +4787,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 12. 整数转罗马数字](https://leetcode-cn.com/problems/integer-to-roman/)**
+> [!NOTE] **[LeetCode 12. 整数转罗马数字](https://leetcode.cn/problems/integer-to-roman/)**
 > 
 > 题意: TODO
 
@@ -4845,7 +4845,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 13. 罗马数字转整数](https://leetcode-cn.com/problems/roman-to-integer/)**
+> [!NOTE] **[LeetCode 13. 罗马数字转整数](https://leetcode.cn/problems/roman-to-integer/)**
 > 
 > 题意: TODO
 
@@ -4931,7 +4931,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[SwordOffer 16. 数值的整数次方](https://leetcode-cn.com/problems/shu-zhi-de-zheng-shu-ci-fang-lcof/)**
+> [!NOTE] **[SwordOffer 16. 数值的整数次方](https://leetcode.cn/problems/shu-zhi-de-zheng-shu-ci-fang-lcof/)**
 > 
 > 题意: TODO
 
@@ -5002,7 +5002,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[SwordOffer 20. 表示数值的字符串](https://leetcode-cn.com/problems/biao-shi-shu-zhi-de-zi-fu-chuan-lcof/)**
+> [!NOTE] **[SwordOffer 20. 表示数值的字符串](https://leetcode.cn/problems/biao-shi-shu-zhi-de-zi-fu-chuan-lcof/)**
 > 
 > 题意: TODO
 
@@ -5110,7 +5110,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 29. 两数相除](https://leetcode-cn.com/problems/divide-two-integers/)**
+> [!NOTE] **[LeetCode 29. 两数相除](https://leetcode.cn/problems/divide-two-integers/)**
 > 
 > 题意: TODO
 
@@ -5272,7 +5272,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 43. 字符串相乘](https://leetcode-cn.com/problems/multiply-strings/)**
+> [!NOTE] **[LeetCode 43. 字符串相乘](https://leetcode.cn/problems/multiply-strings/)**
 > 
 > 题意: TODO
 
@@ -5358,7 +5358,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 65. 有效数字](https://leetcode-cn.com/problems/valid-number/)**
+> [!NOTE] **[LeetCode 65. 有效数字](https://leetcode.cn/problems/valid-number/)**
 > 
 > 题意: TODO
 
@@ -5467,7 +5467,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 66. 加一](https://leetcode-cn.com/problems/plus-one/)**
+> [!NOTE] **[LeetCode 66. 加一](https://leetcode.cn/problems/plus-one/)**
 > 
 > 题意: TODO
 
@@ -5531,7 +5531,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 165. 比较版本号](https://leetcode-cn.com/problems/compare-version-numbers/)**
+> [!NOTE] **[LeetCode 165. 比较版本号](https://leetcode.cn/problems/compare-version-numbers/)**
 > 
 > 题意: TODO
 
@@ -5589,7 +5589,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 166. 分数到小数](https://leetcode-cn.com/problems/fraction-to-recurring-decimal/)**
+> [!NOTE] **[LeetCode 166. 分数到小数](https://leetcode.cn/problems/fraction-to-recurring-decimal/)**
 > 
 > 题意: TODO
 
@@ -5676,7 +5676,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 179. 最大数](https://leetcode-cn.com/problems/largest-number/)**
+> [!NOTE] **[LeetCode 179. 最大数](https://leetcode.cn/problems/largest-number/)**
 > 
 > 题意: TODO
 
@@ -5744,7 +5744,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 273. 整数转换英文表示](https://leetcode-cn.com/problems/integer-to-english-words/)**
+> [!NOTE] **[LeetCode 273. 整数转换英文表示](https://leetcode.cn/problems/integer-to-english-words/)**
 > 
 > 题意: TODO
 
@@ -5817,7 +5817,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 405. 数字转换为十六进制数](https://leetcode-cn.com/problems/convert-a-number-to-hexadecimal/)**
+> [!NOTE] **[LeetCode 405. 数字转换为十六进制数](https://leetcode.cn/problems/convert-a-number-to-hexadecimal/)**
 > 
 > 题意: TODO
 
@@ -5878,7 +5878,7 @@ public:
 
 ### 螺旋矩阵
 
-> [!NOTE] **[LeetCode 54. 螺旋矩阵](https://leetcode-cn.com/problems/spiral-matrix/)**
+> [!NOTE] **[LeetCode 54. 螺旋矩阵](https://leetcode.cn/problems/spiral-matrix/)**
 > 
 > 题意: TODO
 
@@ -5946,7 +5946,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 59. 螺旋矩阵 II](https://leetcode-cn.com/problems/spiral-matrix-ii/)**
+> [!NOTE] **[LeetCode 59. 螺旋矩阵 II](https://leetcode.cn/problems/spiral-matrix-ii/)**
 > 
 > 题意: TODO
 
@@ -6089,7 +6089,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1914. 循环轮转矩阵](https://leetcode-cn.com/problems/cyclically-rotating-a-grid/)**
+> [!NOTE] **[LeetCode 1914. 循环轮转矩阵](https://leetcode.cn/problems/cyclically-rotating-a-grid/)**
 > 
 > 题意: TODO
 
@@ -6193,7 +6193,7 @@ public:
 
 ### excel 表
 
-> [!NOTE] **[LeetCode 168. Excel表列名称](https://leetcode-cn.com/problems/excel-sheet-column-title/)**
+> [!NOTE] **[LeetCode 168. Excel表列名称](https://leetcode.cn/problems/excel-sheet-column-title/)**
 > 
 > 题意: TODO
 
@@ -6274,7 +6274,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 171. Excel表列序号](https://leetcode-cn.com/problems/excel-sheet-column-number/)**
+> [!NOTE] **[LeetCode 171. Excel表列序号](https://leetcode.cn/problems/excel-sheet-column-number/)**
 > 
 > 题意: TODO
 
diff --git a/topic/trick.md b/topic/trick.md
index 8af6173..62907f8 100644
--- a/topic/trick.md
+++ b/topic/trick.md
@@ -2,7 +2,7 @@
 
 ### STL
 
-> [!NOTE] **[LeetCode 537. 复数乘法](https://leetcode-cn.com/problems/complex-number-multiplication/)**
+> [!NOTE] **[LeetCode 537. 复数乘法](https://leetcode.cn/problems/complex-number-multiplication/)**
 > 
 > 题意: TODO
 
@@ -41,7 +41,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 539. 最小时间差](https://leetcode-cn.com/problems/minimum-time-difference/)**
+> [!NOTE] **[LeetCode 539. 最小时间差](https://leetcode.cn/problems/minimum-time-difference/)**
 > 
 > 题意: TODO
 
@@ -136,7 +136,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 609. 在系统中查找重复文件](https://leetcode-cn.com/problems/find-duplicate-file-in-system/)**
+> [!NOTE] **[LeetCode 609. 在系统中查找重复文件](https://leetcode.cn/problems/find-duplicate-file-in-system/)**
 > 
 > 题意: TODO
 
@@ -279,7 +279,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 400. 第N个数字](https://leetcode-cn.com/problems/nth-digit/)**
+> [!NOTE] **[LeetCode 400. 第N个数字](https://leetcode.cn/problems/nth-digit/)**
 > 
 > 题意: TODO
 
@@ -291,7 +291,7 @@ int main() {
 >
 > 经典 数位dp 重复做
 >
-> 同剑指 offer [44. 数字序列中某一位的数字](https://leetcode-cn.com/problems/shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof/)
+> 同剑指 offer [44. 数字序列中某一位的数字](https://leetcode.cn/problems/shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof/)
 
 <details>
 <summary>详细代码</summary>
@@ -360,7 +360,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1366. 通过投票对团队排名](https://leetcode-cn.com/problems/rank-teams-by-votes/)**
+> [!NOTE] **[LeetCode 1366. 通过投票对团队排名](https://leetcode.cn/problems/rank-teams-by-votes/)**
 > 
 > 题意: 
 > 
@@ -457,13 +457,13 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2141. 同时运行 N 台电脑的最长时间](https://leetcode-cn.com/problems/maximum-running-time-of-n-computers/)** [TAG]
+> [!NOTE] **[LeetCode 2141. 同时运行 N 台电脑的最长时间](https://leetcode.cn/problems/maximum-running-time-of-n-computers/)** [TAG]
 > 
 > 题意: TODO
 
 > [!TIP] **思路**
 > 
-> [ABC227 D题](https://leetcode-cn.com/link/?target=https://atcoder.jp/contests/abc227/tasks/abc227_d)
+> [ABC227 D题](https://leetcode.cn/link/?target=https://atcoder.jp/contests/abc227/tasks/abc227_d)
 > 
 > 经典题目 **trick思维**
 
@@ -670,7 +670,7 @@ int main() {
 
 * * *
 
-> [!NOTE] **[LeetCode 423. 从英文中重建数字](https://leetcode-cn.com/problems/reconstruct-original-digits-from-english/)**
+> [!NOTE] **[LeetCode 423. 从英文中重建数字](https://leetcode.cn/problems/reconstruct-original-digits-from-english/)**
 > 
 > 题意: TODO
 
@@ -742,7 +742,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1419. 数青蛙](https://leetcode-cn.com/problems/minimum-number-of-frogs-croaking/)**
+> [!NOTE] **[LeetCode 1419. 数青蛙](https://leetcode.cn/problems/minimum-number-of-frogs-croaking/)**
 > 
 > 题意: TODO
 
@@ -805,7 +805,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 73. 矩阵置零](https://leetcode-cn.com/problems/set-matrix-zeroes/)**
+> [!NOTE] **[LeetCode 73. 矩阵置零](https://leetcode.cn/problems/set-matrix-zeroes/)**
 > 
 > 题意: TODO
 
@@ -897,7 +897,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 128. 最长连续序列](https://leetcode-cn.com/problems/longest-consecutive-sequence/)**
+> [!NOTE] **[LeetCode 128. 最长连续序列](https://leetcode.cn/problems/longest-consecutive-sequence/)**
 > 
 > 题意: TODO
 
@@ -1034,7 +1034,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 258. 各位相加](https://leetcode-cn.com/problems/add-digits/)**
+> [!NOTE] **[LeetCode 258. 各位相加](https://leetcode.cn/problems/add-digits/)**
 > 
 > 题意: TODO
 
@@ -1127,7 +1127,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 334. 递增的三元子序列](https://leetcode-cn.com/problems/increasing-triplet-subsequence/)**
+> [!NOTE] **[LeetCode 334. 递增的三元子序列](https://leetcode.cn/problems/increasing-triplet-subsequence/)**
 > 
 > 题意: TODO
 
@@ -1191,7 +1191,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 414. 第三大的数](https://leetcode-cn.com/problems/third-maximum-number/)**
+> [!NOTE] **[LeetCode 414. 第三大的数](https://leetcode.cn/problems/third-maximum-number/)**
 > 
 > 题意: TODO
 
@@ -1246,7 +1246,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 447. 回旋镖的数量](https://leetcode-cn.com/problems/number-of-boomerangs/)**
+> [!NOTE] **[LeetCode 447. 回旋镖的数量](https://leetcode.cn/problems/number-of-boomerangs/)**
 > 
 > 题意: TODO
 
@@ -1295,7 +1295,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 479. 最大回文数乘积](https://leetcode-cn.com/problems/largest-palindrome-product/)**
+> [!NOTE] **[LeetCode 479. 最大回文数乘积](https://leetcode.cn/problems/largest-palindrome-product/)**
 > 
 > 题意: TODO
 
@@ -1343,7 +1343,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 517. 超级洗衣机](https://leetcode-cn.com/problems/super-washing-machines/)**
+> [!NOTE] **[LeetCode 517. 超级洗衣机](https://leetcode.cn/problems/super-washing-machines/)**
 > 
 > 题意: TODO
 
@@ -1395,7 +1395,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 564. 寻找最近的回文数](https://leetcode-cn.com/problems/find-the-closest-palindrome/)**
+> [!NOTE] **[LeetCode 564. 寻找最近的回文数](https://leetcode.cn/problems/find-the-closest-palindrome/)**
 > 
 > 题意: TODO
 
@@ -1452,7 +1452,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 581. 最短无序连续子数组](https://leetcode-cn.com/problems/shortest-unsorted-continuous-subarray/)**
+> [!NOTE] **[LeetCode 581. 最短无序连续子数组](https://leetcode.cn/problems/shortest-unsorted-continuous-subarray/)**
 > 
 > 题意: TODO
 
@@ -1589,7 +1589,7 @@ class Solution(object):
 
 * * *
 
-> [!NOTE] **[LeetCode 621. 任务调度器](https://leetcode-cn.com/problems/task-scheduler/)**
+> [!NOTE] **[LeetCode 621. 任务调度器](https://leetcode.cn/problems/task-scheduler/)**
 > 
 > 题意: TODO
 
@@ -1657,7 +1657,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 662. 二叉树最大宽度](https://leetcode-cn.com/problems/maximum-width-of-binary-tree/)**
+> [!NOTE] **[LeetCode 662. 二叉树最大宽度](https://leetcode.cn/problems/maximum-width-of-binary-tree/)**
 > 
 > 题意: TODO
 
@@ -1723,7 +1723,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 665. 非递减数列](https://leetcode-cn.com/problems/non-decreasing-array/)**
+> [!NOTE] **[LeetCode 665. 非递减数列](https://leetcode.cn/problems/non-decreasing-array/)**
 > 
 > 题意: TODO
 
@@ -1802,7 +1802,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 717. 1比特与2比特字符](https://leetcode-cn.com/problems/1-bit-and-2-bit-characters/)**
+> [!NOTE] **[LeetCode 717. 1比特与2比特字符](https://leetcode.cn/problems/1-bit-and-2-bit-characters/)**
 > 
 > 题意: TODO
 
@@ -1842,7 +1842,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 738. 单调递增的数字](https://leetcode-cn.com/problems/monotone-increasing-digits/)**
+> [!NOTE] **[LeetCode 738. 单调递增的数字](https://leetcode.cn/problems/monotone-increasing-digits/)**
 > 
 > 题意: TODO
 
@@ -1916,7 +1916,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 768. 最多能完成排序的块 II](https://leetcode-cn.com/problems/max-chunks-to-make-sorted-ii/)**
+> [!NOTE] **[LeetCode 768. 最多能完成排序的块 II](https://leetcode.cn/problems/max-chunks-to-make-sorted-ii/)**
 > 
 > 题意: TODO
 
@@ -1964,7 +1964,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 769. 最多能完成排序的块](https://leetcode-cn.com/problems/max-chunks-to-make-sorted/)**
+> [!NOTE] **[LeetCode 769. 最多能完成排序的块](https://leetcode.cn/problems/max-chunks-to-make-sorted/)**
 > 
 > 题意: TODO
 
@@ -2007,7 +2007,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 777. 在LR字符串中交换相邻字符](https://leetcode-cn.com/problems/swap-adjacent-in-lr-string/)**
+> [!NOTE] **[LeetCode 777. 在LR字符串中交换相邻字符](https://leetcode.cn/problems/swap-adjacent-in-lr-string/)**
 > 
 > 题意: TODO
 
@@ -2202,7 +2202,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 782. 变为棋盘](https://leetcode-cn.com/problems/transform-to-chessboard/)** [TAG]
+> [!NOTE] **[LeetCode 782. 变为棋盘](https://leetcode.cn/problems/transform-to-chessboard/)** [TAG]
 > 
 > 题意: TODO
 
@@ -2267,7 +2267,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 789. 逃脱阻碍者](https://leetcode-cn.com/problems/escape-the-ghosts/)**
+> [!NOTE] **[LeetCode 789. 逃脱阻碍者](https://leetcode.cn/problems/escape-the-ghosts/)**
 > 
 > 题意: TODO
 
@@ -2310,7 +2310,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 792. 匹配子序列的单词数](https://leetcode-cn.com/problems/number-of-matching-subsequences/)**
+> [!NOTE] **[LeetCode 792. 匹配子序列的单词数](https://leetcode.cn/problems/number-of-matching-subsequences/)**
 > 
 > 题意: TODO
 
@@ -2365,7 +2365,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1144. 递减元素使数组呈锯齿状](https://leetcode-cn.com/problems/decrease-elements-to-make-array-zigzag/)**
+> [!NOTE] **[LeetCode 1144. 递减元素使数组呈锯齿状](https://leetcode.cn/problems/decrease-elements-to-make-array-zigzag/)**
 > 
 > 题意: TODO
 
@@ -2414,7 +2414,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1183. 矩阵中 1 的最大数量](https://leetcode-cn.com/problems/maximum-number-of-ones/)** [TAG]
+> [!NOTE] **[LeetCode 1183. 矩阵中 1 的最大数量](https://leetcode.cn/problems/maximum-number-of-ones/)** [TAG]
 > 
 > 题意: TODO
 
@@ -2464,7 +2464,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1191. K 次串联后最大子数组之和](https://leetcode-cn.com/problems/k-concatenation-maximum-sum/)** [TAG]
+> [!NOTE] **[LeetCode 1191. K 次串联后最大子数组之和](https://leetcode.cn/problems/k-concatenation-maximum-sum/)** [TAG]
 > 
 > 题意: TODO
 
@@ -2549,7 +2549,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1247. 交换字符使得字符串相同](https://leetcode-cn.com/problems/minimum-swaps-to-make-strings-equal/)**
+> [!NOTE] **[LeetCode 1247. 交换字符使得字符串相同](https://leetcode.cn/problems/minimum-swaps-to-make-strings-equal/)**
 > 
 > 题意: TODO
 
@@ -2602,7 +2602,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1256. 加密数字](https://leetcode-cn.com/problems/encode-number/)**
+> [!NOTE] **[LeetCode 1256. 加密数字](https://leetcode.cn/problems/encode-number/)**
 > 
 > 题意: TODO
 
@@ -2694,7 +2694,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1328. 破坏回文串](https://leetcode-cn.com/problems/break-a-palindrome/)**
+> [!NOTE] **[LeetCode 1328. 破坏回文串](https://leetcode.cn/problems/break-a-palindrome/)**
 > 
 > 题意: TODO
 
@@ -2745,7 +2745,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1352. 最后 K 个数的乘积](https://leetcode-cn.com/problems/product-of-the-last-k-numbers/)** [TAG]
+> [!NOTE] **[LeetCode 1352. 最后 K 个数的乘积](https://leetcode.cn/problems/product-of-the-last-k-numbers/)** [TAG]
 > 
 > 题意: TODO
 
@@ -2805,7 +2805,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1585. 检查字符串是否可以通过排序子字符串得到另一个字符串](https://leetcode-cn.com/problems/check-if-string-is-transformable-with-substring-sort-operations/)**
+> [!NOTE] **[LeetCode 1585. 检查字符串是否可以通过排序子字符串得到另一个字符串](https://leetcode.cn/problems/check-if-string-is-transformable-with-substring-sort-operations/)**
 > 
 > 题意: TODO
 
@@ -2894,7 +2894,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1702. 修改后的最大二进制字符串](https://leetcode-cn.com/problems/maximum-binary-string-after-change/)** [TAG]
+> [!NOTE] **[LeetCode 1702. 修改后的最大二进制字符串](https://leetcode.cn/problems/maximum-binary-string-after-change/)** [TAG]
 > 
 > 题意: TODO
 
@@ -2947,7 +2947,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1719. 重构一棵树的方案数](https://leetcode-cn.com/problems/number-of-ways-to-reconstruct-a-tree/)** [TAG]
+> [!NOTE] **[LeetCode 1719. 重构一棵树的方案数](https://leetcode.cn/problems/number-of-ways-to-reconstruct-a-tree/)** [TAG]
 > 
 > 题意: TODO
 
@@ -3160,7 +3160,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1733. 需要教语言的最少人数](https://leetcode-cn.com/problems/minimum-number-of-people-to-teach/)** [TAG]
+> [!NOTE] **[LeetCode 1733. 需要教语言的最少人数](https://leetcode.cn/problems/minimum-number-of-people-to-teach/)** [TAG]
 > 
 > 题意: TODO
 
@@ -3226,7 +3226,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1753. 移除石子的最大得分](https://leetcode-cn.com/problems/maximum-score-from-removing-stones/)**
+> [!NOTE] **[LeetCode 1753. 移除石子的最大得分](https://leetcode.cn/problems/maximum-score-from-removing-stones/)**
 > 
 > 题意: TODO
 
@@ -3312,7 +3312,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1775. 通过最少操作次数使数组的和相等](https://leetcode-cn.com/problems/equal-sum-arrays-with-minimum-number-of-operations/)** [TAG]
+> [!NOTE] **[LeetCode 1775. 通过最少操作次数使数组的和相等](https://leetcode.cn/problems/equal-sum-arrays-with-minimum-number-of-operations/)** [TAG]
 > 
 > 题意: TODO
 
@@ -3373,7 +3373,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1802. 有界数组中指定下标处的最大值](https://leetcode-cn.com/problems/maximum-value-at-a-given-index-in-a-bounded-array/)**
+> [!NOTE] **[LeetCode 1802. 有界数组中指定下标处的最大值](https://leetcode.cn/problems/maximum-value-at-a-given-index-in-a-bounded-array/)**
 > 
 > 题意: TODO
 
@@ -3467,7 +3467,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode LCP 33. 蓄水](https://leetcode-cn.com/problems/o8SXZn/)**
+> [!NOTE] **[LeetCode LCP 33. 蓄水](https://leetcode.cn/problems/o8SXZn/)**
 > 
 > 题意: TODO
 
@@ -3527,7 +3527,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1878. 矩阵中最大的三个菱形和](https://leetcode-cn.com/problems/get-biggest-three-rhombus-sums-in-a-grid/)**
+> [!NOTE] **[LeetCode 1878. 矩阵中最大的三个菱形和](https://leetcode.cn/problems/get-biggest-three-rhombus-sums-in-a-grid/)**
 > 
 > 题意: TODO
 
@@ -3657,7 +3657,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1888. 使二进制字符串字符交替的最少反转次数](https://leetcode-cn.com/problems/minimum-number-of-flips-to-make-the-binary-string-alternating/)** [TAG]
+> [!NOTE] **[LeetCode 1888. 使二进制字符串字符交替的最少反转次数](https://leetcode.cn/problems/minimum-number-of-flips-to-make-the-binary-string-alternating/)** [TAG]
 > 
 > 题意: TODO
 
@@ -3891,7 +3891,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1975. 最大方阵和](https://leetcode-cn.com/problems/maximum-matrix-sum/)**
+> [!NOTE] **[LeetCode 1975. 最大方阵和](https://leetcode.cn/problems/maximum-matrix-sum/)**
 > 
 > 题意: TODO
 
@@ -3971,7 +3971,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1996. 游戏中弱角色的数量](https://leetcode-cn.com/problems/the-number-of-weak-characters-in-the-game/)** [TAG]
+> [!NOTE] **[LeetCode 1996. 游戏中弱角色的数量](https://leetcode.cn/problems/the-number-of-weak-characters-in-the-game/)** [TAG]
 > 
 > 题意: TODO
 
@@ -4040,7 +4040,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2009. 使数组连续的最少操作数](https://leetcode-cn.com/problems/minimum-number-of-operations-to-make-array-continuous/)** [TAG]
+> [!NOTE] **[LeetCode 2009. 使数组连续的最少操作数](https://leetcode.cn/problems/minimum-number-of-operations-to-make-array-continuous/)** [TAG]
 > 
 > 题意: TODO
 
@@ -4105,7 +4105,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2025. 分割数组的最多方案数](https://leetcode-cn.com/problems/maximum-number-of-ways-to-partition-an-array/)** [TAG]
+> [!NOTE] **[LeetCode 2025. 分割数组的最多方案数](https://leetcode.cn/problems/maximum-number-of-ways-to-partition-an-array/)** [TAG]
 > 
 > 题意: TODO
 
@@ -4185,7 +4185,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 2117. 一个区间内所有数乘积的缩写](https://leetcode-cn.com/problems/abbreviating-the-product-of-a-range/)** [TAG]
+> [!NOTE] **[LeetCode 2117. 一个区间内所有数乘积的缩写](https://leetcode.cn/problems/abbreviating-the-product-of-a-range/)** [TAG]
 > 
 > 题意: TODO
 
@@ -4258,7 +4258,7 @@ class Solution {
 
 * * *
 
-> [!NOTE] **[LeetCode 2202 K 次操作后最大化顶端元素](https://leetcode-cn.com/problems/maximize-the-topmost-element-after-k-moves/)** [TAG]
+> [!NOTE] **[LeetCode 2202 K 次操作后最大化顶端元素](https://leetcode.cn/problems/maximize-the-topmost-element-after-k-moves/)** [TAG]
 > 
 > 题意: TODO
 
@@ -6817,7 +6817,7 @@ public:
 
 ### 动态统计计数题
 
-> [!NOTE] **[LeetCode 1224. 最大相等频率](https://leetcode-cn.com/problems/maximum-equal-frequency/)** [TAG]
+> [!NOTE] **[LeetCode 1224. 最大相等频率](https://leetcode.cn/problems/maximum-equal-frequency/)** [TAG]
 > 
 > 题意: TODO
 
@@ -6825,7 +6825,7 @@ public:
 >
 > `unordered_map + map` 计数动态统计题
 >
-> 类似的还有 Weekly 12 ：[1244. 力扣排行榜](https://leetcode-cn.com/problems/design-a-leaderboard/)
+> 类似的还有 Weekly 12 ：[1244. 力扣排行榜](https://leetcode.cn/problems/design-a-leaderboard/)
 
 <details>
 <summary>详细代码</summary>
@@ -6890,7 +6890,7 @@ public:
 
 ### 剪绳子
 
-> [!NOTE] **[SwordOffer 14- I. 剪绳子](https://leetcode-cn.com/problems/jian-sheng-zi-lcof/)**
+> [!NOTE] **[SwordOffer 14- I. 剪绳子](https://leetcode.cn/problems/jian-sheng-zi-lcof/)**
 > 
 > 题意: TODO
 
@@ -6978,7 +6978,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 343. 整数拆分](https://leetcode-cn.com/problems/integer-break/)**
+> [!NOTE] **[LeetCode 343. 整数拆分](https://leetcode.cn/problems/integer-break/)**
 > 
 > 题意: TODO
 
@@ -7036,7 +7036,7 @@ public:
 
 ### 跳跃游戏
 
-> [!NOTE] **[LeetCode 55. 跳跃游戏](https://leetcode-cn.com/problems/jump-game/)**
+> [!NOTE] **[LeetCode 55. 跳跃游戏](https://leetcode.cn/problems/jump-game/)**
 > 
 > 题意: TODO
 
@@ -7117,7 +7117,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 45. 跳跃游戏 II](https://leetcode-cn.com/problems/jump-game-ii/)**
+> [!NOTE] **[LeetCode 45. 跳跃游戏 II](https://leetcode.cn/problems/jump-game-ii/)**
 > 
 > 题意: TODO
 
@@ -7206,7 +7206,7 @@ class Solution:
 
 * * *
 
-> [!NOTE] **[LeetCode 1306. 跳跃游戏 III](https://leetcode-cn.com/problems/jump-game-iii/)**
+> [!NOTE] **[LeetCode 1306. 跳跃游戏 III](https://leetcode.cn/problems/jump-game-iii/)**
 > 
 > 题意: 每个位置上可以左右跳 $arr[i]$ 个距离
 
@@ -7260,7 +7260,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1345. 跳跃游戏 IV](https://leetcode-cn.com/problems/jump-game-iv/)** [TAG]
+> [!NOTE] **[LeetCode 1345. 跳跃游戏 IV](https://leetcode.cn/problems/jump-game-iv/)** [TAG]
 > 
 > 题意: TODO
 
@@ -7333,7 +7333,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1340. 跳跃游戏 V](https://leetcode-cn.com/problems/jump-game-v/)**
+> [!NOTE] **[LeetCode 1340. 跳跃游戏 V](https://leetcode.cn/problems/jump-game-v/)**
 > 
 > 题意: TODO
 
@@ -7387,7 +7387,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1871. 跳跃游戏 VII](https://leetcode-cn.com/problems/jump-game-vii/)**
+> [!NOTE] **[LeetCode 1871. 跳跃游戏 VII](https://leetcode.cn/problems/jump-game-vii/)**
 > 
 > 题意: TODO
 
@@ -7479,7 +7479,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 763. 划分字母区间](https://leetcode-cn.com/problems/partition-labels/)**
+> [!NOTE] **[LeetCode 763. 划分字母区间](https://leetcode.cn/problems/partition-labels/)**
 > 
 > 题意: TODO
 
@@ -7544,7 +7544,7 @@ class Solution:
 
 ### 构造连续区间
 
-> [!NOTE] **[LeetCode 330. 按要求补齐数组](https://leetcode-cn.com/problems/patching-array/)**
+> [!NOTE] **[LeetCode 330. 按要求补齐数组](https://leetcode.cn/problems/patching-array/)**
 > 
 > 题意: TODO
 
@@ -7588,7 +7588,7 @@ public:
 
 * * *
 
-> [!NOTE] **[LeetCode 1798. 你能构造出连续值的最大数目](https://leetcode-cn.com/problems/maximum-number-of-consecutive-values-you-can-make/)** [TAG]
+> [!NOTE] **[LeetCode 1798. 你能构造出连续值的最大数目](https://leetcode.cn/problems/maximum-number-of-consecutive-values-you-can-make/)** [TAG]
 > 
 > 题意: TODO