<p>There is a strange printer with the following two special properties:</p>

<ul>
	<li>The printer can only print a sequence of <strong>the same character</strong> each time.</li>
	<li>At each turn, the printer can print new characters starting from and ending at any place and will cover the original existing characters.</li>
</ul>

<p>Given a string <code>s</code>, return <em>the minimum number of turns the printer needed to print it</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;aaabbb&quot;
<strong>Output:</strong> 2
<strong>Explanation:</strong> Print &quot;aaa&quot; first and then print &quot;bbb&quot;.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;aba&quot;
<strong>Output:</strong> 2
<strong>Explanation:</strong> Print &quot;aaa&quot; first and then print &quot;b&quot; from the second place of the string, which will cover the existing character &#39;a&#39;.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 100</code></li>
	<li><code>s</code> consists of lowercase English letters.</li>
</ul>

# class Solution:
#     def strangePrinter(self, s: str) -> int:
#         if not s:
#             return 0 
#         n = len(s)
#         dp = [[n] * n for i in range(n)]
#         for i in range(n):
#             dp[i][i] = 1
#         for l in range(2, n + 1):
#             for i in range(n - l + 1):
#                 j = i + l - 1
#                 dp[i][j] = dp[i + 1][j] + 1
#                 for k in range(i + 1, j + 1):
#                     if s[i] == s[k]:
#                         if k < j:
#                             dp[i][j] = min(dp[i][j], dp[i][k - 1] + dp[k + 1][j])
#                         else:
#                             dp[i][j] = min(dp[i][j], dp[i][k - 1] + 0) 
#         print(dp)
#         return dp[0][n - 1]


class Solution:
    def strangePrinter(self, s: str) -> int:
        if not s:
            return 0
        n = len(s)
        dp = [[n] * n  for i in range(n)]
        for i in range(n):
            dp[i][i] = 1
        for l in range(2, n + 1):
            for i in range(0, n - l + 1):
                j = i + l - 1
                print('.....')
                print(i)
                print(j)
                print(l)
                print('.....')
                dp[i][j] = dp[i][j - 1] + 1
                # if s[i] == s[j]:
                #     dp[i][j] = min(dp[i][j - 1], dp[i][j])
                for x in range(i , j + 1):
                    if s[x] == s[j]:
                        if x == i:
                            dp[i][j] = min(dp[i + 1][j], dp[i][j])
                        # elif x == j:
                        #     dp[i][j] = min(dp[i][j - 1], dp[i][j])
                        else:
                           dp[i][j] = min(dp[i][x - 1] + dp[x][j], dp[i][j])
                        

        print(dp)
        return dp[0][n - 1]
                             
        
17200