From eeefc8499b70137fdc6ddd07ab6940959fd3124e Mon Sep 17 00:00:00 2001
From: Baturu <45113401+z80160280@users.noreply.github.com>
Date: Mon, 7 Jun 2021 21:52:32 -0700
Subject: [PATCH] =?UTF-8?q?Update=200309.=E6=9C=80=E4=BD=B3=E4=B9=B0?=
 =?UTF-8?q?=E5=8D=96=E8=82=A1=E7=A5=A8=E6=97=B6=E6=9C=BA=E5=90=AB=E5=86=B7?=
 =?UTF-8?q?=E5=86=BB=E6=9C=9F.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/0309.最佳买卖股票时机含冷冻期.md b/problems/0309.最佳买卖股票时机含冷冻期.md
index 44ca2b26..4667c122 100644
--- a/problems/0309.最佳买卖股票时机含冷冻期.md
+++ b/problems/0309.最佳买卖股票时机含冷冻期.md
@@ -189,6 +189,21 @@ class Solution {
 
 Python：
 
+```python
+class Solution:
+    def maxProfit(self, prices: List[int]) -> int:
+        n = len(prices)
+        if n == 0:
+            return 0
+        dp = [[0] * 4 for _ in range(n)]
+        dp[0][0] = -prices[0] #持股票
+        for i in range(1, n):
+            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]
+        return max(dp[n-1][3], dp[n-1][1], dp[n-1][2])
+```
 
 Go：