https://leetcode.cn/problems/maximum-number-of-non-overlapping-palindrome-substrings

Author: masx200

README.md

@@ -131,6 +131,8 @@ https://leetcode.cn/problems/magical-string/
 
 https://leetcode.cn/problems/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof/
 
+https://leetcode.cn/problems/maximum-number-of-non-overlapping-palindrome-substrings
+
 https://leetcode.cn/problems/nge-tou-zi-de-dian-shu-lcof
 
 https://leetcode.cn/problems/count-of-matches-in-tournament/

maximum-number-of-non-overlapping-palindrome-substrings/index.ts

@@ -0,0 +1,13 @@
+export default function maxPalindromes(s: string, k: number): number {
+    const n = s.length;
+    const f: number[] = Array(n + 1).fill(0);
+    for (let i = 0; i < 2 * n - 1; ++i) {
+        let l = Math.floor(i / 2),
+            r = l + (i % 2); // 中心扩展法
+        f[l + 1] = Math.max(f[l + 1], f[l]);
+        for (; l >= 0 && r < n && s[l] == s[r]; --l, ++r) {
+            if (r - l + 1 >= k) f[r + 1] = Math.max(f[r + 1], f[l] + 1);
+        }
+    }
+    return f[n];
+}