LeetCode664. Strange Printer——区间dp

原创已于 2024-03-12 10:44:25 修改 · 613 阅读

9 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #数据结构 #leetcode #开发语言 #c++

于 2024-03-12 10:44:01 首次发布

文章讨论了一种特殊的打印机，只能连续打印相同字符，要求找出打印给定字符串所需的最少步骤。通过动态规划方法求解，计算覆盖整个字符串的最小操作次数。

文章目录

- 一、题目
- 二、题解

一、题目

There is a strange printer with the following two special properties:

The printer can only print a sequence of the same character each time.
At each turn, the printer can print new characters starting from and ending at any place and will cover the original existing characters.
Given a string s, return the minimum number of turns the printer needed to print it.

Example 1:

Input: s = “aaabbb”
Output: 2
Explanation: Print “aaa” first and then print “bbb”.
Example 2:

Input: s = “aba”
Output: 2
Explanation: Print “aaa” first and then print “b” from the second place of the string, which will cover the existing character ‘a’.

Constraints:

1 <= s.length <= 100
s consists of lowercase English letters.

二、题解

class Solution {
public:
    int strangePrinter(string s) {
        int n = s.size();
        vector<vector<int>> dp(n,vector<int>(n,0));
        dp[n-1][n-1] = 1;
        for(int i = 0;i < n - 1;i++){
            dp[i][i] = 1;
			dp[i][i + 1] = s[i] == s[i + 1] ? 1 : 2;
        }
        for (int l = n - 3; l >= 0; l--) {
			for (int r = l + 2; r < n; r++) {
				if (s[l] == s[r]) {
					dp[l][r] = dp[l][r - 1];
				} else {
					int res = INT_MAX;
					for (int m = l; m < r; m++) {
						res = min(res, dp[l][m] + dp[m + 1][r]);
					}
					dp[l][r] = res;
				}
			}
		}
		return dp[0][n - 1];
    }
};