修改内容

2025-05-08 02:27:28 +08:00 · 2025-05-08 02:27:28 +08:00 · 1c833dcb62
commit 1c833dcb62
parent 12133791ed
1 changed files with 1 additions and 1 deletions
--- 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)$ 要高效得多。