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

Merge pull request #2095 from HOUSHENGREN/master

Browse Source 
fix：0123.买卖股票的最佳时机III =》错误修改
This commit is contained in:
程序员Carl
2023-06-05 08:50:12 +08:00
committed by GitHub
parent b4e0fbf429 f9277fe7dc
commit 7e0820b6d1
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
problems/0123.买卖股票的最佳时机III.md
View File

@ -242,9 +242,9 @@ class Solution {
for (int i = 1; i < len; i++) {
dp[i][1] = Math.max(dp[i - 1][1], -prices[i]);
dp[i][2] = Math.max(dp[i - 1][2], dp[i][1] + prices[i]);
dp[i][3] = Math.max(dp[i - 1][3], dp[i][2] - prices[i]);
dp[i][4] = Math.max(dp[i - 1][4], dp[i][3] + prices[i]);
dp[i][2] = Math.max(dp[i - 1][2], dp[i - 1][1] + prices[i]);
dp[i][3] = Math.max(dp[i - 1][3], dp[i - 1][2] - prices[i]);
dp[i][4] = Math.max(dp[i - 1][4], dp[i - 1][3] + prices[i]);
}
return dp[len - 1][4];