Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 664 with 26 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 664 # by problem number
lcpy gen -s strange_printer # by problem name
s, return the minimum number of turns the printer needed to print it.
Input: s = "aaabbb"
Output: 2
Explanation: Print "aaa" first and then print "bbb".
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'.
1 <= s.length <= 100s consists of lowercase English letters.class Solution:
# Time: O(n^3)
# Space: O(n^2)
def strange_printer(self, s: str) -> int:
n = len(s)
dp = [[0] * n for _ in range(n)]
for i in range(n - 1, -1, -1):
dp[i][i] = 1
for j in range(i + 1, n):
best = dp[i][j - 1] + 1
for k in range(i, j):
if s[k] == s[j]:
mid = dp[k + 1][j - 1] if k + 1 <= j - 1 else 0
best = min(best, dp[i][k] + mid)
dp[i][j] = best
return dp[0][n - 1]
| Time | Space |
|---|---|
| O(n^3) | O(n^2) |