今天好累啊 想摆了 摸鱼
class Solution {
public:
vector<int> partitionLabels(string s) {
int n = s.length();
int last[26];
for (int i = 0; i < n; i++)
{
last[s[i] - 'a'] = i;
}
vector<int> result;
int end = 0, start = 0;
for (int j = 0; j < n; j++)
{
end = max(end, last[s[j] - 'a']);
if (j == end)
{
result.push_back( end - start + 1);
start = end + 1;
}
}
return result;
}
};