<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 {
public:
    string shorten(string s){
        string temp="";
        char pvs='*';
        for(auto it:s){
            if(pvs!=it){
                temp.push_back(it);
                pvs= it;
            }
        }
        return temp;
    }

    int mini(string st, int i, int j, vector<vector<int>>& dp){
        if (i > j) return 0;
        if (i == j) return 1;
        if (dp[i][j] != -1) return dp[i][j];

        int ans = 1 + mini(st, i + 1, j, dp); 
        for (int k = i + 1; k <= j; k++) {
            if (st[i] == st[k]) {
                ans = min(ans, mini(st, i, k - 1, dp) + mini(st, k + 1, j, dp));
            }
        }

        return dp[i][j] = ans;
    }
    int strangePrinter(string s) {
        string ans= shorten(s);
        cout<< ans<< endl;
        int n = ans.size();
        vector<vector<int>> dp(n, vector<int>(n, -1));
        return mini(ans, 0, n - 1, dp);
    }
};
77657