Leetcode1278

最新推荐文章于 2021-08-31 22:23:22 发布

dezhonger

最新推荐文章于 2021-08-31 22:23:22 发布

阅读量189

点赞数

分类专栏： leetcode dp

本文链接：https://blog.csdn.net/dezhonger/article/details/103341776

版权

leetcode 同时被 2 个专栏收录

116 篇文章 0 订阅

订阅专栏

16 篇文章 0 订阅

订阅专栏

给一个字符串，将字符串拆为k个回文字符串，问最少需要修改多少个字符

sol: dp

初始化为每个字符串变为回文串,需要修改的字符串数

        for (int len = 1; len <= n; len++) {
            for (int i = 0; i < n; i++) {
                int j = i + len - 1;
                if (j >= n) break;
                if (len == 1) cost[i][j] = 0;
                else if (len == 2) {
                    cost[i][j] = s.charAt(i) == s.charAt(j) ? 0 : 1;
                } else {
                    cost[i][j] = s.charAt(i) == s.charAt(j) ? cost[i + 1][j - 1] : cost[i + 1][j - 1] + 1;
                }
            }
        }

考虑动态规划, dp(i, j)表示将s(0, 1, ...i）拆为j个回文子串需要修改的字符数量

显然dp(i, 1) = cost[0][i]

转移方程为dp(i, j) = min(dp(k, j-1) + cost[k+1][i], k < j

    public int palindromePartition(String s, int k) {
        int n = s.length();
        int[][] cost = new int[n][n];

        //the cost of make s(i, j) palindrome
        for (int len = 1; len <= n; len++) {
            for (int i = 0; i < n; i++) {
                int j = i + len - 1;
                if (j >= n) break;
                if (len == 1) cost[i][j] = 0;
                else if (len == 2) {
                    cost[i][j] = s.charAt(i) == s.charAt(j) ? 0 : 1;
                } else {
                    cost[i][j] = s.charAt(i) == s.charAt(j) ? cost[i + 1][j - 1] : cost[i + 1][j - 1] + 1;
                }
            }
        }

        //dp[i][j]: the number char need to change to make s(0, 1, ...i) split to j palindrome
        int[][] dp = new int[n][k + 1];
        for (int i = 0; i < n; i++) Arrays.fill(dp[i], 10000);
        for (int i = 0; i < n; i++) {
            dp[i][1] = cost[0][i];
        }
        for (int j = 2; j <= k; j++) {
            for (int i = j - 1; i < n; i++) {
                for (int o = i - 1; o >= j - 2; o--) {
                    dp[i][j] = Math.min(dp[i][j], dp[o][j - 1] + cost[o + 1][i]);

                }
            }
        }
        return dp[n - 1][k];
    }