From 2719dbdd0eeeaf534acf09f0a67d3f84bae84a04 Mon Sep 17 00:00:00 2001 From: fwqaaq Date: Sat, 3 Jun 2023 14:58:09 +0800 Subject: [PATCH] =?UTF-8?q?Update=200122.=E4=B9=B0=E5=8D=96=E8=82=A1?= =?UTF-8?q?=E7=A5=A8=E7=9A=84=E6=9C=80=E4=BD=B3=E6=97=B6=E6=9C=BAII?= =?UTF-8?q?=EF=BC=88=E5=8A=A8=E6=80=81=E8=A7=84=E5=88=92=EF=BC=89.md?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- ...0122.买卖股票的最佳时机II（动态规划）.md | 7 ++++--- 1 file changed, 4 insertions(+), 3 deletions(-) diff --git a/problems/0122.买卖股票的最佳时机II（动态规划）.md b/problems/0122.买卖股票的最佳时机II（动态规划）.md index 5976f258..43e567c5 100644 --- a/problems/0122.买卖股票的最佳时机II（动态规划）.md +++ b/problems/0122.买卖股票的最佳时机II（动态规划）.md @@ -384,9 +384,10 @@ impl Solution { impl Solution { pub fn max_profit(prices: Vec) -> i32 { let mut dp = vec![-prices[0], 0]; - for i in 1..=prices.len() { - dp[0] = dp[0].max(dp[1] - prices[i - 1]); - dp[1] = dp[1].max(dp[0] + prices[i - 1]); + for p in prices { + // 可以看作 low、res + dp[0] = dp[0].max(dp[1] - p); + dp[1] = dp[1].max(dp[0] + p); } dp[1] }