[leetcode]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.

思路：1. 和Palindrome Partitioning I 类似，求出字符串的substr是否是回文

    2. 再用一个2D dp在算最小回文cut，因为初始化的问题，代码看起来略恶心。。。后面再改吧

class Solution {
public:
    int minCut(string s) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int N = s.size();
        
        vector<vector<bool>> isPalin(N, vector<bool>(N, 1));
        
        for(int i = N-1; i >= 0; i--){
            for(int j = i+1; j <= N; j++){
                if(j-1 < 0 || i+1 >= N) continue;
                isPalin[i][j] = isPalin[i+1][j-1] && s[i] == s[j];
                
            }
        }
        
        
        vector<int> f(N+1, 0);
        int tmp;
        
        for(int i = 1; i <= N; i++){
            if(isPalin[0][i-1]){
                f[i] = 0;
                continue;
            }
            
            tmp = i-1;
            
            for(int j = 1; j <= i; j++){
                if(isPalin[j-1][i-1]){
                    tmp = min(tmp, f[j-1] + 1);
                }
            }
            f[i] = tmp;
        }
        
        return f[N];
        
    }
};