132. Palindrome Partitioning II

题目原网址为https://leetcode.com/problems/palindrome-partitioning-ii/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) {
        int n = s.size();
        vector<vector<bool>> dp(n);
        for (int i = 0; i < n; i++)
            dp[i].resize(n);
        for (int len = 0; len < n; len++) {
            for (int i = 0; i < n - len; i++) {
                if (len == 0){
                    dp[i][i + len] = true;
                } else if (len == 1) {
                    dp[i][i + len] = s[i] == s[i + len];
                } else if (dp[i+1][i + len - 1] && s[i] == s[i + len]) {
                    dp[i][i + len] = true;
                } else {
                    dp[i][i + len] = false;
                }
            }
        }
        int count = 0;
        queue<int> q;
        vector<bool> visited(n, false);
        for (int j = 0; j < n; j++) {
            if (dp[0][j]) {
                q.push(j + 1);
                visited[j] = true;
            }
        }
        while (!q.empty()) {
            int num = q.size();
            for (int i = 0; i < num; i++) {
                int index = q.front();
                q.pop();
                if (index == n) {
                    return count;
                }

                for (int j = index; j < n; j++) {
                    if (dp[index][j] && !visited[j]) {
                        q.push(j + 1);
                        visited[j] = true;
                    }
                }
            }
            count++;
        }
        return count;
    }
};