二刷343

Author: diguage

docs/0343-integer-break.adoc

@@ -30,15 +30,35 @@ Given a positive integer _n_, break it into the sum of *at least* two positive i
 
 == 解题分析
 
-image::images/0343-1.png[{image_attr}]
+image::images/0343-02.png[{image_attr}]
+
+image::images/0343-01.png[{image_attr}]
 
 [[src-0343]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0343_IntegerBreak.java[tag=answer]
 ----
+--
+
+二刷::
++
+--
+[{java_src_attr}]
+----
+include::{sourcedir}/_0343_IntegerBreak_2.java[tag=answer]
+----
+--
+====
 
 == 参考资料
 
-. https://leetcode-cn.com/problems/jian-sheng-zi-lcof/solution/mian-shi-ti-14-i-jian-sheng-zi-tan-xin-si-xiang-by/[面试题14- I. 剪绳子（数学推导 / 贪心思想，清晰图解） - 剪绳子 - 力扣（LeetCode）^] -- 数学分析真牛逼！
+. https://leetcode.cn/problems/jian-sheng-zi-lcof/solutions/104809/mian-shi-ti-14-i-jian-sheng-zi-tan-xin-si-xiang-by/[面试题14- I. 剪绳子（数学推导 / 贪心思想，清晰图解） - 剪绳子 - 力扣（LeetCode）^] -- 数学分析真牛逼！
+. https://leetcode.cn/problems/integer-break/solutions/352875/zheng-shu-chai-fen-by-leetcode-solution/[343. 整数拆分 - 官方题解^]
+. https://leetcode.cn/problems/integer-break/solutions/353190/shou-hua-tu-jie-di-gui-ji-yi-hua-di-gui-dong-tai-g/[343. 整数拆分 - 「手画图解」递归、记忆化递归、动态规划^]
 

docs/images/0343-1.png renamed to docs/images/0343-01.png

@@ -464,6 +464,11 @@
 |{doc_base_url}/0063-unique-paths-ii.adoc[题解]
 |动态规划
 
+|{counter:codes}
+|{leetcode_base_url}/integer-break/[343. Integer Break^]
+|{doc_base_url}/0343-integer-break.adoc[题解]
+|动态规划
+
 |===
 
 截止目前，本轮练习一共完成 {codes} 道题。

docs/images/0343-02.png

@@ -15,6 +15,9 @@ public class _0343_IntegerBreak {
      * Memory Usage: 38.1 MB, less than 14.29% of Java online submissions for Integer Break.
      *
      * Copy from: https://leetcode-cn.com/problems/jian-sheng-zi-lcof/solution/mian-shi-ti-14-i-jian-sheng-zi-tan-xin-si-xiang-by/[面试题14- I. 剪绳子（数学推导 / 贪心思想，清晰图解） - 剪绳子 - 力扣（LeetCode）]
+     *
+     * @author D瓜哥 · https://www.diguage.com
+     * @since 2020-04-26 16:38
      */
     public int integerBreak(int n) {
         if (n < 2) {

logbook/202406.adoc

@@ -0,0 +1,24 @@
+package com.diguage.algo.leetcode;
+
+public class _0343_IntegerBreak_2 {
+  // tag::answer[]
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-09-13 16:08:50
+   */
+  public int integerBreak(int n) {
+    // 1. 确定 dp 数组（dp table）以及下标的含义
+    //    dp[i] 表示 i 值被拆分后最大乘积数
+    // 3. dp 数组，默认就是0， 0、1拆分后最大乘积就是0，无需初始化
+    int[] dp = new int[n + 1];
+    // 4. 确定遍历顺序，从 1 → n/2 + 1 逐个遍历
+    for (int i = 2; i <= n; i++) {
+      for (int j = 1; j < i / 2 + 1; j++) {
+        // 2. 确定递推公式: dp[i] = max(j*(i-j), j * dp[i - j])
+        dp[i] = Math.max(Math.max(j * (i - j), j * dp[i - j]), dp[i]);
+      }
+    }
+    return dp[n];
+  }
+  // end::answer[]
+}