LeetCode 132 - 分割回文串 II

题目描述

132. 分割回文串 II

解法一：DP（Python）

详细参考 liweiwei1419

class Solution:
    def minCut(self, s: str) -> int:
        n = len(s)
        dp = [i for i in range(n)]

        for i in range(1, n):
            if s[:i+1] == s[:i+1][::-1]:
                dp[i]= 0
                continue
            dp[i] = min([dp[j] + 1 for j in range(i) if s[j+1:i+1] == s[j+1:i+1][::-1]])
        
        return dp[n - 1]

解法二：对回文子串的判断做出优化（Python）

对回文子串判断做出的优化详细参考 LeetCode 5 -最长回文子串

class Solution:
    def minCut(self, s: str) -> int:
        n = len(s)
        if n <2: return 0
        dp = [i for i in range(n)]
        check_palindrome = [[False for _ in range(n)] for _ in range(n)]

        for right in range(n):
            for left in range(right + 1):
                if s[left] == s[right] and (right - left <= 2 or check_palindrome[left + 1][right - 1]):
                    check_palindrome[left][right] = True

        for i in range(1, n):
            if check_palindrome[0][i]:
                dp[i] = 0
                continue 
            dp[i] = min([dp[j] + 1 for j in range(i) if check_palindrome[j+1][i]])

        return dp[n - 1]

解法三：DP II（Python）

详细参考 ytyhero007

class Solution {
public:
    int minCut(string s) {
        int n = s.length();
        vector<int> dp(n+1);
        for(int i=0;i<n+1;i++)
            dp[i] = i - 1;
        for(int i=0;i<n;i++)
        {
            dp[i+1] = min(dp[i+1], dp[i]+1);
            if(i== n-1) break;
            int start = i, end = i+1;
            while(s[start]==s[end])
            {
                dp[end+1] = min(dp[end+1], dp[start]+1);
                if(end==n-1 || start == 0) break;
                start--, end++;
            }
            start = i-1, end = i+1;
            if(start<0) continue;
            while(s[start]==s[end])
            {
                dp[end+1] = min(dp[end+1], dp[start]+1);
                if(end==n-1 || start == 0) break;
                start--, end++;
            }
            if(dp[n]==0) return 0;
        }
        return dp[n];
    }
};