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.

解题：首先预处理出[i,j]的子串是否为回文串.

dp[i]:表示[0,i]需要的最小切割次数，则我们最终求得的结果便为dp[n-1].

dp[i] = min(dp[i], dp[j]+1) (j->i为一回文串)

class Solution {
public:
    bool check(string s, int l, int r) {
        for(int i = l, j = r; i < j; ++i, --j) {
            if(s[i] != s[j]) {
                return false;
            }
        }
        return true;
    }
    int minCut(string s) {
        bool mark[2010][2010];
        int dp[2010];
        int n = s.length();
        if(check(s, 0, n - 1)) return 0;
        memset(mark, false, sizeof(mark));
        for(int i = 0; i < n; ++i) {
            mark[i][i] = true;
            if(i + 1 < n && s[i] == s[i+1]) {
                mark[i][i+1] = true;
            }
        }
        for(int k = 2; k < n; ++k) {
            for(int i = 0; i + k < n; ++i) {
                int j = i + k;
                if(s[i] == s[j]) {
                    mark[i][j] |= mark[i+1][j-1];
                } else {
                    mark[i][j] = false;
                }
            }
        }
        dp[0] = 0;
        for(int i = 1; i < n; ++i) {
            if(check(s, 0, i)) {
                dp[i] = 0;
                continue;
            }
            dp[i] = dp[i-1] + 1;
            for(int j = i - 1; j > 0; --j) {
                if(mark[j][i]) {
                    dp[i] = min(dp[i], dp[j-1] + 1);
                }
            }
        }
        return dp[n-1];
    }
};