algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 03:34:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

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

Browse Source 
冗余代码
This commit is contained in:
hengzzha
2021-07-04 09:03:43 +08:00
committed by GitHub
parent e2d8c0a1cd
commit 52ed0ac5d3
1 changed files with 0 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
problems/动态规划-股票问题总结篇.md
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++ ```C++
dp[i][0] = max(dp[i - 1][0], max(dp[i - 1][3]- prices[i], dp[i - 1][1]) - prices[i]; 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]); dp[i][1] = max(dp[i - 1][1], dp[i - 1][3]);