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

Update problems/0122.买卖股票的最佳时机II（动态规划）.md

Browse Source
This commit is contained in:
fwqaaq
2023-06-03 14:59:17 +08:00
committed by GitHub
parent 2719dbdd0e
commit 2a6a8da5e0
1 changed files with 0 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
problems/0122.买卖股票的最佳时机II（动态规划）.md
View File

@ -385,7 +385,6 @@ impl Solution {
pub fn max_profit(prices: Vec<i32>) -> i32 { pub fn max_profit(prices: Vec<i32>) -> i32 {
let mut dp = vec![-prices[0], 0]; let mut dp = vec![-prices[0], 0];
for p in prices { for p in prices {
// 可以看作 low、res
dp[0] = dp[0].max(dp[1] - p); dp[0] = dp[0].max(dp[1] - p);
dp[1] = dp[1].max(dp[0] + p); dp[1] = dp[1].max(dp[0] + p);
} }