From 405ad285388943bea466e2d5300378be9aa2fc0a Mon Sep 17 00:00:00 2001
From: haiker2011 <haizhou.uestc2011@gmail.com>
Date: Mon, 8 Oct 2018 19:50:30 +0800
Subject: [PATCH] Squashed commit of the following:
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

commit 977b50859e760f0a8ee1c3fdcff49d7040b09bfa
Author: 孙海洲 <haizhou.uestc2011@gmail.com>
Date:   Sun Sep 30 21:39:11 2018 +0800

    Update 面试总结.md
---
 notes/面试总结.md | 26 ++++++++++++++------------
 1 file changed, 14 insertions(+), 12 deletions(-)

diff --git a/notes/面试总结.md b/notes/面试总结.md
index 7f98eff2..e7ec89c9 100644
--- a/notes/面试总结.md
+++ b/notes/面试总结.md
@@ -1092,18 +1092,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):
@@ -1239,6 +1227,20 @@ class Solution:
         return pow(base, exponent)
 ```
 
+### 动态规划
+
+```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.