From 4926d659a7937c880e631c4cde4f017d7e3e193e Mon Sep 17 00:00:00 2001
From: YusenAi <59075298+Aitensa@users.noreply.github.com>
Date: Wed, 1 Sep 2021 16:39:46 +0800
Subject: [PATCH] =?UTF-8?q?Update=200714.=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=BA=E5=90=AB?=
 =?UTF-8?q?=E6=89=8B=E7=BB=AD=E8=B4=B9=EF=BC=88=E5=8A=A8=E6=80=81=E8=A7=84?=
 =?UTF-8?q?=E5=88=92=EF=BC=89.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...�佳时机含手续费（动态规划）.md | 18 ++++++++++++++++++
 1 file changed, 18 insertions(+)

diff --git a/problems/0714.买卖股票的最佳时机含手续费（动态规划）.md b/problems/0714.买卖股票的最佳时机含手续费（动态规划）.md
index 50db8868..b854c65c 100644
--- a/problems/0714.买卖股票的最佳时机含手续费（动态规划）.md
+++ b/problems/0714.买卖股票的最佳时机含手续费（动态规划）.md
@@ -152,6 +152,24 @@ class Solution:
 ```
 
 Go：
+```Go
+func maxProfit(prices []int, fee int) int {
+    n := len(prices)
+    dp := make([][2]int, n)
+    dp[0][0] = -prices[0]
+    for i := 1; i < n; i++ {
+        dp[i][1] = max(dp[i-1][1], dp[i-1][0]+prices[i]-fee)
+        dp[i][0] = max(dp[i-1][0], dp[i-1][1]-prices[i])
+    }
+    return dp[n-1][1]
+}
+func max(a, b int) int {
+    if a > b {
+        return a
+    }
+    return b
+}
+```
 
 Javascript：
 ```javascript