Skip to content

Partition Labels⚓︎

Link

Description⚓︎

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

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

Return a list of integers representing the size of these parts.

Example 1:

  • Input: s = "ababcbacadefegdehijhklij"
  • Output: [9,7,8]
  • Explanation:
1
2
3
The partition is "ababcbaca", "defegde", "hijhklij".
This is a partition so that each letter appears in at most one part.
A partition like "ababcbacadefegde", "hijhklij" is incorrect, because it splits s into less parts.

Example 2:

  • Input: s = "eccbbbbdec"
  • Output: [10]

Constraints:

  • 1 <= s.length <= 500
  • s consists of lowercase English letters.

Solution⚓︎

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
class Solution {
public:
    vector<int> partitionLabels(string s) {
        int last[26];
        int len = s.size();
        for (int i = 0; i < len; i++) last[s[i] - 'a'] = i;

        vector<int> partition;
        int start = 0, end = 0;
        for (int i = 0; i < len; i++) {
            end = max(end, last[s[i] - 'a']);
            if (i == end) {
                partition.emplace_back(end - start + 1);
                start = end = i + 1;
            }
        }
        return partition;
    }
};
  • Time complexity: \(O(n)\);
  • Space complexity: \(O(26)\).