Skip to content

[pull] master from labuladong:master #38

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged

pull merged 1 commit into AlgorithmAndLeetCode:master from labuladong:master

Dec 11, 2022

+2 −0

Merged

[pull] master from labuladong:master #38

Changes from all commits

Commits

Show all changes

Select commit

labuladong Dec 11, 2022

File filter

Filter by extension

Conversations

Jump to

Jump to file

Failed to load files.

Loading

Diff view

Diff view

1 change: 1 addition & 0 deletions 动态规划系列/动态规划详解进阶.md

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
Expand Up		@@ -479,6 +479,7 @@ int coinChange(int[] coins, int amount) {
		\| [221. Maximal Square](https://leetcode.com/problems/maximal-square/?show=1) \| [221. 最大正方形](https://leetcode.cn/problems/maximal-square/?show=1) \|
		\| [240. Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/?show=1) \| [240. 搜索二维矩阵 II](https://leetcode.cn/problems/search-a-2d-matrix-ii/?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) \|
		\| [542. 01 Matrix](https://leetcode.com/problems/01-matrix/?show=1) \| [542. 01 矩阵](https://leetcode.cn/problems/01-matrix/?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) \|
Expand Down

1 change: 1 addition & 0 deletions 动态规划系列/最优子结构.md

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
Expand Up		@@ -365,6 +365,7 @@ for (int i = 1; i < m; i++)
		\| [139. Word Break](https://leetcode.com/problems/word-break/?show=1) \| [139. 单词拆分](https://leetcode.cn/problems/word-break/?show=1) \|
		\| [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) \|
		\| [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