<p>You are given a string <code>s</code>. We want to partition the string into as many parts as possible so that each letter appears in at most one part.</p>

<p>Note that the partition is done so that after concatenating all the parts in order, the resultant string should be <code>s</code>.</p>

<p>Return <em>a list of integers representing the size of these parts</em>.</p>

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

<pre>
<strong>Input:</strong> s = &quot;ababcbacadefegdehijhklij&quot;
<strong>Output:</strong> [9,7,8]
<strong>Explanation:</strong>
The partition is &quot;ababcbaca&quot;, &quot;defegde&quot;, &quot;hijhklij&quot;.
This is a partition so that each letter appears in at most one part.
A partition like &quot;ababcbacadefegde&quot;, &quot;hijhklij&quot; is incorrect, because it splits s into less parts.
</pre>

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

<pre>
<strong>Input:</strong> s = &quot;eccbbbbdec&quot;
<strong>Output:</strong> [10]
</pre>

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

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

class Solution {
public:
    vector<int> partitionLabels(string s) {

        std::array<int, 26> freq{0};

        std::vector<int> res;

        for (size_t i = 0; i < s.length(); i++) {
            freq[s[i] - 'a'] = i;
        }

        for (size_t i = 0; i < freq.size(); i++)
            cout << freq[i] << ",";
        cout << "\n";

        int len{};
        int prev_len{};

        for (size_t i = 0; i < s.length(); i = len) {
            
            cout << i <<"\n";
            for (size_t j = i; j <= len; j++) {
                if (freq[s[j] - 'a'] > len)
                    len = freq[s[j] - 'a'];
            }

            ++len;
            res.empty() ? res.push_back(len) : res.push_back(len - prev_len);

            prev_len = res.size() == 1 ? len : std::accumulate(res.begin(), res.end(), 0);;
            cout << "len:" << len<<"\n";
        }

        return res;
    }
};
7800