Leetcode--Palindrome Partitioning II

标签：des   style   color   io   os   ar   for   art   问题   

Problem Description：

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.

class Solution {
public:

    int minCut(string s) {
        //if(s.size()==0)
        //    return 0;
        int n=s.size();
        vector<vector<int> > flag(n,vector<int>(n,0));
        vector<int> cut(n+1);
        
        for(int i=0;i<=n;i++)
            cut[i]=i-1;
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<=i;j++)
            {
                if(s[i]==s[j]&&(i-j<2||flag[j+1][i-1]==1))
                {
                    flag[j][i]=1;
                    cut[i+1]=min(cut[i+1],cut[j]+1);
                }
            }
        }
        return cut[n];
        
    }
};

Leetcode--Palindrome Partitioning II

标签：des   style   color   io   os   ar   for   art   问题   

原文地址：http://blog.csdn.net/longhopefor/article/details/39210651