From 6ee7831f5739edc8915d04c4842736920fc773dd Mon Sep 17 00:00:00 2001
From: Baturu <45113401+z80160280@users.noreply.github.com>
Date: Mon, 7 Jun 2021 21:45:24 -0700
Subject: [PATCH] =?UTF-8?q?Update=200188.=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=BAIV.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0188.买卖股票的最佳时机IV.md | 14 ++++++++++++++
 1 file changed, 14 insertions(+)

diff --git a/problems/0188.买卖股票的最佳时机IV.md b/problems/0188.买卖股票的最佳时机IV.md
index f0adc237..431c292b 100644
--- a/problems/0188.买卖股票的最佳时机IV.md
+++ b/problems/0188.买卖股票的最佳时机IV.md
@@ -212,6 +212,20 @@ class Solution { //动态规划
 
 Python：
 
+```python
+class Solution:
+    def maxProfit(self, k: int, prices: List[int]) -> int:
+        if len(prices) == 0:
+            return 0
+        dp = [[0] * (2*k+1) for _ in range(len(prices))]
+        for j in range(1, 2*k, 2):
+            dp[0][j] = -prices[0]
+        for i in range(1, len(prices)):
+            for j in range(0, 2*k-1, 2):
+                dp[i][j+1] = max(dp[i-1][j+1], dp[i-1][j] - prices[i])
+                dp[i][j+2] = max(dp[i-1][j+2], dp[i-1][j+1] + prices[i])
+        return dp[-1][2*k]
+```
 
 Go：