Update 动态规划-股票问题总结篇.md

冗余代码
This commit is contained in:
hengzzha
2021-07-04 09:03:43 +08:00
committed by GitHub
parent e2d8c0a1cd
commit 52ed0ac5d3

View File

@ -375,12 +375,6 @@ p[i][3] = dp[i - 1][2];
综上分析,递推代码如下:
```C++
dp[i][0] = max(dp[i - 1][0], max(dp[i - 1][3], dp[i - 1][1]) - prices[i];
dp[i][1] = max(dp[i - 1][1], dp[i - 1][3]);
dp[i][2] = dp[i - 1][0] + prices[i];
dp[i][3] = dp[i - 1][2];
```
```C++
dp[i][0] = max(dp[i - 1][0], max(dp[i - 1][3]- prices[i], dp[i - 1][1]) - prices[i];
dp[i][1] = max(dp[i - 1][1], dp[i - 1][3]);