Commit 850391c

authored

Merge pull request #149 from wangxinalex/patch-3

Update 01.Linear-DP-01.md

2 parents 381b4c8 + e6237f7 commit 850391cCopy full SHA for 850391c

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -83,7 +83,7 @@`
`83`	`83`
`84`	`84`	`- 如果 $nums[j] < nums[i],ドル则 $nums[i]$ 可以接在 $nums[j]$ 后面,此时以 $nums[i]$ 结尾的最长递增子序列长度会在「以 $nums[j]$ 结尾的最长递增子序列长度」的基础上加 1ドル,ドル即:$dp[i] = dp[j] + 1$。`
`85`	`85`
`86`		`-- 如果 $nums[j] \le nums[i],ドル则 $nums[i]$ 不可以接在 $nums[j]$ 后面,可以直接跳过。`
	`86`	`+- 如果 $nums[j] \ge nums[i],ドル则 $nums[i]$ 不可以接在 $nums[j]$ 后面,可以直接跳过。`
`87`	`87`
`88`	`88`	`综上,我们的状态转移方程为:$dp[i] = max(dp[i], dp[j] + 1), 0 \le j < i, nums[j] < nums[i]$。`
`89`	`89`

Comments

(0)