We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 1a52ea2 commit 79a77d2Copy full SHA for 79a77d2
minsoo/leetcode/strange_printer.py
@@ -0,0 +1,16 @@
1
+# https://leetcode.com/problems/strange-printer/
2
+
3
4
+class Solution:
5
+ def strangePrinter(self, s: str) -> int:
6
+ dp = [[0 for _ in s] for _ in s]
7
8
+ for i in reversed(range(len(s))):
9
+ dp[i][i] = 1
10
+ for j in range(i + 1, len(s)):
11
+ if s[i] == s[j]:
12
+ dp[i][j] = dp[i][j - 1] # or dp[i + 1][j]
13
+ else:
14
+ dp[i][j] = min(dp[i][k] + dp[k + 1][j] for k in range(i, j))
15
16
+ return dp[0][-1]
0 commit comments