leetcode 132. Palindrome Partitioning II

题目：

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.

参考：http://blog.csdn.net/jin_kwok/article/details/51423222

class Solution {  
public:  
    int minCut(string s)   
    {  
        vector<vector<int>> dp;  
        vector<int> temp;  
        for(int i=0;i<s.size();i++)  
        temp.push_back(0);  
          
        for(int i=0;i<s.size();i++)  
            dp.push_back(temp);  
      
        vector<int> cut(s.size()+1,0);  
          
        for(int i=s.size()-1;i>=0;i--)  
        {  
            cut[i]=INT_MAX;  
            for(int j=i;j<s.size();j++)  
            {  
                if(s.at(i)==s.at(j)&&(j-i<=1||dp[i+1][j-1]==1))  
                {  
                    dp[i][j]=1;  
                    cut[i]=min(1+cut[j+1],cut[i]);    
                }  
            }  
        }  
        return cut[0]-1;    
    }  
};