1745. 分割回文串 IV

class Solution:
    # 1278. 分割回文串 III
    def palindromePartition(self, s: str, k: int) -> int:
        n = len(s)
        min_change = [[0] * n for _ in range(n)]
        for i in range(n - 2, -1, -1):
            for j in range(i + 1, n):
                min_change[i][j] = min_change[i + 1][j - 1] + (1 if s[i] != s[j] else 0)

        f = min_change[0]
        for i in range(1, k):
            for r in range(n - k + i, i - 1, -1):
                f[r] = min(f[l - 1] + min_change[l][r] for l in range(i, r + 1))
        return f[-1]

    def checkPartitioning(self, s: str) -> bool:
        return self.palindromePartition(s, 3) == 0

作者：灵茶山艾府
链接：https://leetcode.cn/problems/palindrome-partitioning-iv/solutions/3589992/zhi-jie-diao-yong-1278-ti-dai-ma-pythonj-u7pw/
来源：力扣（LeetCode）
著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。