From c19d2a58490c5511679931873de9c27ae5d95f51 Mon Sep 17 00:00:00 2001
From: Corki <61616424+KangJ227@users.noreply.github.com>
Date: Thu, 27 May 2021 09:49:06 +0800
Subject: [PATCH] =?UTF-8?q?0343.=E6=95=B4=E6=95=B0=E6=8B=86=E5=88=86=20Jav?=
 =?UTF-8?q?a=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0343.整数拆分.md | 18 +++++++++++++++++-
 1 file changed, 17 insertions(+), 1 deletion(-)

diff --git a/problems/0343.整数拆分.md b/problems/0343.整数拆分.md
index a6bd7211..c9423a1a 100644
--- a/problems/0343.整数拆分.md
+++ b/problems/0343.整数拆分.md
@@ -194,7 +194,23 @@ public:
 
 
 Java：
-
+```Java
+class Solution {
+    public int integerBreak(int n) {
+        //dp[i]为正整数i拆分结果的最大乘积
+        int[] dp = new int[n+1]; 
+        dp[2] = 1;
+        for (int i = 3; i <= n; ++i) {
+            for (int j = 1; j < i - 1; ++j) {
+                //j*(i-j)代表把i拆分为j和i-j两个数相乘
+                //j*dp[i-j]代表把i拆分成j和继续把(i-j)这个数拆分，取(i-j)拆分结果中的最大乘积与j相乘
+                dp[i] = Math.max(dp[i], Math.max(j * (i - j), j * dp[i - j]));
+            }
+        }
+        return dp[n];
+    }
+}
+```
 
 Python：