[LeetCode 解题报告]132. Palindrome Partitioning II

最新推荐文章于 2021-06-13 19:59:01 发布

caicaiatnbu

最新推荐文章于 2021-06-13 19:59:01 发布

阅读量144

点赞数

分类专栏： LeetCode 解题报告

本文链接：https://blog.csdn.net/caicaiatnbu/article/details/103817498

版权

LeetCode 解题报告专栏收录该内容

154 篇文章 5 订阅

订阅专栏

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.

Example:

Input: "aab"
Output: 1
Explanation: The palindrome partitioning ["aa","b"] could be produced using 1 cut.

考察：dp；

class Solution {
public:
    int minCut(string s) {
        vector<vector<bool>> flag(s.length(), vector<bool>(s.length(), false));
        vector<int> dp(s.length()+1, 0);
        
        for (int i = 0; i <= s.length(); i ++)
            dp[i] = s.length() - i - 1;
        
        for (int i = s.length()-1; i >= 0; i --) {
            for (int j = i; j < s.length(); j ++) {
                if (s[i] == s[j] && (j-i <= 1 || flag[i+1][j-1])) {
                    flag[i][j] = true;
                    dp[i] = min(dp[i], dp[j+1]+1);
                }
            }
        }
        return dp.front();
    }
};