<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:
    void removeConsecutiveDuplicates(string& s){
        int j = 1;
        for(int i=1;i<s.size();i++){
            if(s[i] != s[i-1]){
                s[j] = s[i];
                j++;
            }
        }
        s.resize(j);
    }

    int minNumberOfTurns(int start, int end, string& s, vector<vector<int>>& memo){
        if(start > end){
            return 0;
        }

        if(memo[start][end] != -1){
            return memo[start][end];
        }

        int minTurns = 1 + minNumberOfTurns(start + 1, end, s, memo);
        int minTurnsSegements = 0;
        for(int i = start + 1; i <= end; i++){
            if(s[start] == s[i]){
                cout << s.substr(start, i - start) << " " << s.substr(i+1) << endl;
                minTurnsSegements = minNumberOfTurns(start, i-1, s, memo) +
                                    minNumberOfTurns(i+1, end, s, memo);
                minTurns = min(minTurns, minTurnsSegements);
            }
        }

        memo[start][end] = minTurns;
        return minTurns;
    }

    int strangePrinter(string s) {
        removeConsecutiveDuplicates(s);
        int n = s.size();
        vector<vector<int>> memo(n, vector<int>(n, -1));
        return minNumberOfTurns(0, n - 1, s,  memo);
    }
};
29327