Commit 06782a5

committed

Update 01.Tree-DP.md

1 parent a995573 commit 06782a5Copy full SHA for 06782a5

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -2,7 +2,7 @@`
`2`	`2`
`3`	`3`	`> 树形动态规划:简称为「树形 DP」,是一种在树形结构上进行推导的动态规划方法。如下图所示,树形 DP 的求解过程一般以节点从深到浅(子树从小到大)的顺序作为动态规划的「阶段」。在树形 DP 中,第 1ドル$ 维通常是节点编号,代表以该节点为根的子树。`
`4`	`4`
`5`		`-![](https://qcdn.itcharge.cn/images/20230418114342.png)`
	`5`	`+![树形 DP](https://qcdn.itcharge.cn/images/20240514113355.png)`
`6`	`6`
`7`	`7`	`树形 DP 问题的划分方法有多种方式。`
`8`	`8`

Comments

(0)