Dec 12, 2022 · Dec 12, 2022 · Dec 12, 2022
diff --git a/动态规划系列/动态规划设计:最长递增子序列.md b/动态规划系列/动态规划设计:最长递增子序列.md
diff --git a/动态规划系列/动态规划详解进阶.md b/动态规划系列/动态规划详解进阶.md
diff --git a/动态规划系列/最优子结构.md b/动态规划系列/最优子结构.md
diff --git a/算法思维系列/UnionFind算法详解.md b/算法思维系列/UnionFind算法详解.md
diff --git a/高频面试系列/子集排列组合.md b/高频面试系列/子集排列组合.md
Original file line number	Diff line number	Diff line change
Expand Up		@@ -319,6 +319,7 @@ int lengthOfLIS(int[] nums) {
		\| :----: \| :----: \|
		\| [1425. Constrained Subsequence Sum](https://leetcode.com/problems/constrained-subsequence-sum/?show=1) \| [1425. 带限制的子序列和](https://leetcode.cn/problems/constrained-subsequence-sum/?show=1) \|
		\| [256. Paint House](https://leetcode.com/problems/paint-house/?show=1)🔒 \| [256. 粉刷房子](https://leetcode.cn/problems/paint-house/?show=1)🔒 \|
	\| [368. Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset/?show=1) \| [368. 最大整除子集](https://leetcode.cn/problems/largest-divisible-subset/?show=1) \|
		\| - \| [剑指 Offer II 091. 粉刷房子](https://leetcode.cn/problems/JEj789/?show=1) \|

		</details>
Expand Down
Original file line number	Diff line number	Diff line change
Expand Up		@@ -481,6 +481,7 @@ int coinChange(int[] coins, int amount) {
		\| [256. Paint House](https://leetcode.com/problems/paint-house/?show=1)🔒 \| [256. 粉刷房子](https://leetcode.cn/problems/paint-house/?show=1)🔒 \|
		\| [343. Integer Break](https://leetcode.com/problems/integer-break/?show=1) \| [343. 整数拆分](https://leetcode.cn/problems/integer-break/?show=1) \|
		\| [542. 01 Matrix](https://leetcode.com/problems/01-matrix/?show=1) \| [542. 01 矩阵](https://leetcode.cn/problems/01-matrix/?show=1) \|
	\| [576. Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths/?show=1) \| [576. 出界的路径数](https://leetcode.cn/problems/out-of-boundary-paths/?show=1) \|
		\| [62. Unique Paths](https://leetcode.com/problems/unique-paths/?show=1) \| [62. 不同路径](https://leetcode.cn/problems/unique-paths/?show=1) \|
		\| [63. Unique Paths II](https://leetcode.com/problems/unique-paths-ii/?show=1) \| [63. 不同路径 II](https://leetcode.cn/problems/unique-paths-ii/?show=1) \|
		\| [70. Climbing Stairs](https://leetcode.com/problems/climbing-stairs/?show=1) \| [70. 爬楼梯](https://leetcode.cn/problems/climbing-stairs/?show=1) \|
Expand Down
Original file line number	Diff line number	Diff line change
Expand Up		@@ -366,6 +366,7 @@ for (int i = 1; i < m; i++)
		\| [221. Maximal Square](https://leetcode.com/problems/maximal-square/?show=1) \| [221. 最大正方形](https://leetcode.cn/problems/maximal-square/?show=1) \|
		\| [256. Paint House](https://leetcode.com/problems/paint-house/?show=1)🔒 \| [256. 粉刷房子](https://leetcode.cn/problems/paint-house/?show=1)🔒 \|
		\| [343. Integer Break](https://leetcode.com/problems/integer-break/?show=1) \| [343. 整数拆分](https://leetcode.cn/problems/integer-break/?show=1) \|
	\| [576. Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths/?show=1) \| [576. 出界的路径数](https://leetcode.cn/problems/out-of-boundary-paths/?show=1) \|
		\| [63. Unique Paths II](https://leetcode.com/problems/unique-paths-ii/?show=1) \| [63. 不同路径 II](https://leetcode.cn/problems/unique-paths-ii/?show=1) \|
		\| [91. Decode Ways](https://leetcode.com/problems/decode-ways/?show=1) \| [91. 解码方法](https://leetcode.cn/problems/decode-ways/?show=1) \|
		\| - \| [剑指 Offer II 091. 粉刷房子](https://leetcode.cn/problems/JEj789/?show=1) \|
Expand Down
Original file line number	Diff line number	Diff line change
Expand Up		@@ -561,6 +561,7 @@ class UF {
		\| [1361. Validate Binary Tree Nodes](https://leetcode.com/problems/validate-binary-tree-nodes/?show=1) \| [1361. 验证二叉树](https://leetcode.cn/problems/validate-binary-tree-nodes/?show=1) \|
		\| [200. Number of Islands](https://leetcode.com/problems/number-of-islands/?show=1) \| [200. 岛屿数量](https://leetcode.cn/problems/number-of-islands/?show=1) \|
		\| [261. Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree/?show=1)🔒 \| [261. 以图判树](https://leetcode.cn/problems/graph-valid-tree/?show=1)🔒 \|
	\| [368. Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset/?show=1) \| [368. 最大整除子集](https://leetcode.cn/problems/largest-divisible-subset/?show=1) \|
		\| [765. Couples Holding Hands](https://leetcode.com/problems/couples-holding-hands/?show=1) \| [765. 情侣牵手](https://leetcode.cn/problems/couples-holding-hands/?show=1) \|
		\| [947. Most Stones Removed with Same Row or Column](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column/?show=1) \| [947. 移除最多的同行或同列石头](https://leetcode.cn/problems/most-stones-removed-with-same-row-or-column/?show=1) \|

Expand Down
Original file line number	Diff line number	Diff line change
Expand Up		@@ -944,6 +944,7 @@ void backtrack(int[] nums) {
		\| LeetCode \| 力扣 \|
		\| :----: \| :----: \|
		\| [17. Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/?show=1) \| [17. 电话号码的字母组合](https://leetcode.cn/problems/letter-combinations-of-a-phone-number/?show=1) \|
	\| [368. Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset/?show=1) \| [368. 最大整除子集](https://leetcode.cn/problems/largest-divisible-subset/?show=1) \|
		\| [491. Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences/?show=1) \| [491. 递增子序列](https://leetcode.cn/problems/increasing-subsequences/?show=1) \|
		\| - \| [剑指 Offer 38. 字符串的排列](https://leetcode.cn/problems/zi-fu-chuan-de-pai-lie-lcof/?show=1) \|
		\| - \| [剑指 Offer II 079. 所有子集](https://leetcode.cn/problems/TVdhkn/?show=1) \|
Expand Down