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

Update 0123.买卖股票的最佳时机III.md 使用元祖优化命名

Browse Source
This commit is contained in:
fwqaaq
2023-06-30 13:14:26 +08:00
committed by GitHub
parent 85daaae465
commit e452f183ad
1 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -447,15 +447,15 @@ impl Solution {
```rust ```rust
impl Solution { impl Solution {
pub fn max_profit(prices: Vec<i32>) -> i32 { pub fn max_profit(prices: Vec<i32>) -> i32 {
let mut dp = vec![0, -prices[0], 0, -prices[0], 0]; let (mut one_buy, mut one_sale, mut two_buy, mut two_sale) = (-prices[0], 0, -prices[0], 0);
for p in prices { for p in prices {
dp[1] = dp[1].max(-p); one_buy = one_buy.max(-p);
dp[2] = dp[2].max(dp[1] + p); one_sale = one_sale.max(p + one_buy);
dp[3] = dp[3].max(dp[2] - p); two_buy = two_buy.max(one_sale - p);
dp[4] = dp[4].max(dp[3] + p); two_sale = two_sale.max(two_buy + p);
} }
dp[4] two_sale
} }
} }
``` ```