Skip to content

[pull] main from itcharge:main #190

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 2 commits into AlgorithmAndLeetCode:main from itcharge:main

Jul 4, 2024

Merged

[pull] main from itcharge:main #190

Changes from all commits

Commits

Show all changes

Select commit Hold shift + click to select a range

Update 01.Linear-DP-01.md

wangxinalex Jul 3, 2024

Merge pull request #149 from wangxinalex/patch-3

itcharge Jul 4, 2024

File filter

Filter by extension

Conversations

Jump to

Jump to file

Failed to load files.

Loading

Diff view

Diff view

2 changes: 1 addition & 1 deletion Contents/10.Dynamic-Programming/03.Linear-DP/01.Linear-DP-01.md

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
Expand Up		@@ -83,7 +83,7 @@

		- 如果 $nums[j] < nums[i],ドル则 $nums[i]$ 可以接在 $nums[j]$ 后面,此时以 $nums[i]$ 结尾的最长递增子序列长度会在「以 $nums[j]$ 结尾的最长递增子序列长度」的基础上加 1ドル,ドル即:$dp[i] = dp[j] + 1$。

	- 如果 $nums[j] \le nums[i],ドル则 $nums[i]$ 不可以接在 $nums[j]$ 后面,可以直接跳过。
	- 如果 $nums[j] \ge nums[i],ドル则 $nums[i]$ 不可以接在 $nums[j]$ 后面,可以直接跳过。

		综上,我们的状态转移方程为:$dp[i] = max(dp[i], dp[j] + 1), 0 \le j < i, nums[j] < nums[i]$。

Expand Down