diff --git a/content/post/算法题/分割回文串dp.md b/content/post/算法题/分割回文串dp.md
index 6c1f477..3125d73 100644
--- a/content/post/算法题/分割回文串dp.md
+++ b/content/post/算法题/分割回文串dp.md
@@ -125,4 +125,4 @@ public static int minCut(String s) {
     return dp[len-1];
 }
 ```
-
+这样优化后的时间复杂度是 $O(n^2)$，空间复杂度也是 $O(n^2)$，比上文中的 $O(2^n)$ 要高效得多。