mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-07 15:45:40 +08:00
Update 0123.买卖股票的最佳时机III.md about rust
This commit is contained in:
@ -413,7 +413,34 @@ function maxProfit(prices: number[]): number {
|
||||
};
|
||||
```
|
||||
|
||||
Rust:
|
||||
|
||||
> 版本一
|
||||
|
||||
```rust
|
||||
impl Solution {
|
||||
pub fn max_profit(prices: Vec<i32>) -> i32 {
|
||||
/*
|
||||
* 定义 5 种状态:
|
||||
* 0: 没有操作, 1: 第一次买入, 2: 第一次卖出, 3: 第二次买入, 4: 第二次卖出
|
||||
*/
|
||||
let mut dp = vec![vec![0; 5]; prices.len()];
|
||||
dp[0][1] = -prices[0];
|
||||
dp[0][3] = -prices[0];
|
||||
|
||||
for (i, &p) in prices.iter().enumerate().skip(1) {
|
||||
// 不操作
|
||||
// dp[i][0] = dp[i - 1][0];
|
||||
dp[i][1] = dp[i - 1][1].max(-p);
|
||||
dp[i][2] = dp[i - 1][2].max(dp[i - 1][1] + p);
|
||||
dp[i][3] = dp[i - 1][3].max(dp[i - 1][2] - p);
|
||||
dp[i][4] = dp[i - 1][4].max(dp[i - 1][3] + p);
|
||||
}
|
||||
|
||||
dp[prices.len() - 1][4]
|
||||
}
|
||||
}
|
||||
```
|
||||
|
||||
|
||||
<p align="center">
|
||||
|
Reference in New Issue
Block a user