From b3c0d03885496324d5cea3427ccd6cd633368e0a Mon Sep 17 00:00:00 2001
From: Runze Liao <72693579+tony8888lrz@users.noreply.github.com>
Date: Fri, 20 Sep 2024 16:56:31 -0700
Subject: [PATCH] =?UTF-8?q?Update=200343.=E6=95=B4=E6=95=B0=E6=8B=86?=
 =?UTF-8?q?=E5=88=86.md=20Java=E7=89=88=E6=9C=AC=E5=A2=9E=E5=8A=A0?=
 =?UTF-8?q?=E8=B4=AA=E5=BF=83=E7=AE=97=E6=B3=95=EF=BC=8C=E6=B8=85=E6=99=B0?=
 =?UTF-8?q?=E6=B3=A8=E9=87=8A?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/0343.整数拆分.md b/problems/0343.整数拆分.md
index 7295627f..3ba23e52 100644
--- a/problems/0343.整数拆分.md
+++ b/problems/0343.整数拆分.md
@@ -243,6 +243,29 @@ class Solution {
     }
 }
 ```
+贪心
+```Java
+class Solution {
+    public int integerBreak(int n) {
+        // with 贪心
+        // 通过数学原理拆出更多的3乘积越大，则
+        /**
+         @Param: an int, the integer we need to break.
+         @Return: an int, the maximum integer after breaking
+         @Method: Using math principle to solve this problem
+         @Time complexity: O(1)
+        **/
+        if(n == 2) return 1;
+        if(n == 3) return 2;
+        int result = 1;
+        while(n > 4) {
+            n-=3;
+            result *=3;
+        }
+        return result*n;
+    }
+}
+```
 
 ### Python
 动态规划（版本一）