Commit f54cc50

authored

Update Readme.md

Avoid overwrite.

1 parent 1ae8e13 commit f54cc50Copy full SHA for f54cc50

File tree

-2

lines changed

-2

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -7,15 +7,15 @@`
`7`	`7`	`这就是01背包问题的基本思想。如果dp的空间大小合理,那么我们就可以来解决之前DFS所无法处理的复杂度。基本的模板如下:`
`8`	`8`	```
`9`	`9`	`for (auto x: nums) // 遍历物品`
`10`		`- for (auto s= 0 to sum/2) // 遍历容量`
	`10`	`+ for (auto s= sum/2 to 0) // 遍历容量`
`11`	`11`	`if dp'[s-x] = true`
`12`	`12`	`dp[s] = true // 如果考察x之前,已经能够凑出s-x,那么加上x这个数字就一定能凑出和为x的subset。`
`13`	`13`	```
`14`	`14`
`15`	`15`	`此外还有另外一种dp的写法`
`16`	`16`	```
`17`	`17`	`for (auto x: nums) // 遍历物品`
`18`		`- for (auto s= 0 to sum/2) // 遍历容量`
	`18`	`+ for (auto s= sum/2 to 0) // 遍历容量`
`19`	`19`	`if dp'[s] = true`
`20`	`20`	`dp[s+x] = true // 如果考察x之前,已经能够凑出s,那么加上x这个数字就一定能凑出和为s+x的subset。`
`21`	`21`	```

Comments

(0)