LeetCode:Palindrome Partitioning Ⅱ(DP)

Problem

Given a string s, partition s such that every substring of the partition is a palindrome.

Return the minimum cuts needed for a palindrome partitioning of s.

For example, given s = "aab",
Return 1 since the palindrome partitioning ["aa","b"] could be produced using 1 cut.

 

定义状态f[i] =区间[i,n-1]的最小cut数  p[i][j]表示是s[i]到s[j]是否为回文串

Solution

class Solution {
public:
    int minCut(string s) {
        
        //dp
        const int n=s.size();
        int f[n+1];
        bool p[n][n];
        fill_n(&p[0][0],n*n,false);
        
        //worst
        for(int i=0;i<=n;i++)
           f[i]=n-1-i;
           
        for(int i=n-1;i>=0;i--)
            for(int j=i;j<n;j++)
            if(s[i]==s[j]&&(j-i<2||p[i+1][j-1]))
            {
                p[i][j]=true;
                f[i]=min(f[i],f[j+1]+1);
            }
            
            return f[0];
       

        
    }
};