Update 面试总结.md

notes/面试总结.md

@@ -1090,18 +1090,6 @@ public int integerBreak(int n) {
 }
 ```
 
-### 动态规划
-
-```java
-public int integerBreak(int n) {
-    int[] dp = new int[n + 1];
-    dp[1] = 1;
-    for (int i = 2; i <= n; i++)
-        for (int j = 1; j < i; j++)
-            dp[i] = Math.max(dp[i], Math.max(j * (i - j), dp[j] * (i - j)));
-    return dp[n];
-}
-```
 
 ```python
 def integerBreak(n):
@@ -1118,6 +1106,20 @@ def integerBreak(n):
     return pow(3, timesOf3) * pow(2, timesOf2)
 ```
 
+### 动态规划
+
+```java
+public int integerBreak(int n) {
+    int[] dp = new int[n + 1];
+    dp[1] = 1;
+    for (int i = 2; i <= n; i++)
+        for (int j = 1; j < i; j++)
+            dp[i] = Math.max(dp[i], Math.max(j * (i - j), dp[j] * (i - j)));
+    return dp[n];
+}
+```
+
+
 # 参考文献
 
 - 何海涛. 剑指 Offer[M]. 电子工业出版社, 2012.