From e3f88873f66c432c7571f5278a2db2e00a5d0a88 Mon Sep 17 00:00:00 2001
From: Frogrey <35210929+Frogrey@users.noreply.github.com>
Date: Mon, 3 Jan 2022 15:44:28 +0800
Subject: [PATCH] =?UTF-8?q?309.=E6=9C=80=E4=BD=B3=E4=B9=B0=E5=8D=96?=
 =?UTF-8?q?=E8=82=A1=E7=A5=A8=E6=97=B6=E6=9C=BA=E5=90=AB=E5=86=B7=E5=86=BB?=
 =?UTF-8?q?=E6=9C=9F=20=E9=80=92=E6=8E=A8=E4=BB=A3=E7=A0=81=E5=B0=91?=
 =?UTF-8?q?=E4=BA=86=E4=B8=80=E4=B8=AA=E6=8B=AC=E5=8F=B7?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0309.最佳买卖股票时机含冷冻期.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/problems/0309.最佳买卖股票时机含冷冻期.md b/problems/0309.最佳买卖股票时机含冷冻期.md
index 82555f80..10cdd5fd 100644
--- a/problems/0309.最佳买卖股票时机含冷冻期.md
+++ b/problems/0309.最佳买卖股票时机含冷冻期.md
@@ -95,7 +95,7 @@ p[i][3] = dp[i - 1][2];
 综上分析，递推代码如下：
 
 ```CPP
-dp[i][0] = max(dp[i - 1][0], max(dp[i - 1][3], dp[i - 1][1]) - prices[i];
+dp[i][0] = max(dp[i - 1][0], max(dp[i - 1][3], dp[i - 1][1]) - prices[i]);
 dp[i][1] = max(dp[i - 1][1], dp[i - 1][3]);
 dp[i][2] = dp[i - 1][0] + prices[i];
 dp[i][3] = dp[i - 1][2];