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

309.最佳买卖股票时机含冷冻期 递推代码少了一个括号

Browse Source
This commit is contained in:
Frogrey
2022-01-03 15:44:28 +08:00
committed by GitHub
parent aaf85841ed
commit e3f88873f6
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0309.最佳买卖股票时机含冷冻期.md
View File

@ -95,7 +95,7 @@ p[i][3] = dp[i - 1][2];
综上分析，递推代码如下： 综上分析，递推代码如下：
```CPP ```CPP
dp[i][0] = max(dp[i - 1][0], max(dp[i - 1][3], dp[i - 1][1]) - prices[i]; 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][1] = max(dp[i - 1][1], dp[i - 1][3]);
dp[i][2] = dp[i - 1][0] + prices[i]; dp[i][2] = dp[i - 1][0] + prices[i];
dp[i][3] = dp[i - 1][2]; dp[i][3] = dp[i - 1][2];