From e476ac95872857c363a89203386b2156c3971d33 Mon Sep 17 00:00:00 2001
From: wzs <1014355013@qq.com>
Date: Wed, 12 May 2021 23:26:17 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A00714.=E4=B9=B0=E5=8D=96?=
 =?UTF-8?q?=E8=82=A1=E7=A5=A8=E7=9A=84=E6=9C=80=E4=BD=B3=E6=97=B6=E6=9C=BA?=
 =?UTF-8?q?=E5=90=AB=E6=89=8B=E7=BB=AD=E8=B4=B9=E5=92=8CJava=E7=89=88?=
 =?UTF-8?q?=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...买卖股票的最佳时机含手续费.md | 24 ++++++++++++++++++-
 1 file changed, 23 insertions(+), 1 deletion(-)

diff --git a/problems/0714.买卖股票的最佳时机含手续费.md b/problems/0714.买卖股票的最佳时机含手续费.md
index 92697a64..6d0e6a5e 100644
--- a/problems/0714.买卖股票的最佳时机含手续费.md
+++ b/problems/0714.买卖股票的最佳时机含手续费.md
@@ -154,9 +154,31 @@ public:
 
 ## 其他语言版本
 
-
 Java：
 
+```java
+class Solution { // 动态规划
+    public int maxProfit(int[] prices, int fee) {
+        if (prices == null || prices.length < 2) {
+            return 0;
+        }
+
+        int[][] dp = new int[prices.length][2];
+
+        // bad case
+        dp[0][0] = 0;
+        dp[0][1] = -prices[0];
+
+        for (int i = 1; i < prices.length; i++) {
+            dp[i][0] = Math.max(dp[i - 1][0], dp[i - 1][1] + prices[i] - fee);
+            dp[i][1] = Math.max(dp[i - 1][1], dp[i - 1][0] - prices[i]);
+        }
+
+        return dp[prices.length - 1][0];
+    }
+}
+```
+
 
 Python：