Partition Labels
Given a string S of lowercase English letters.
We want to partition this string into as many parts as possible so that each letter appears in at most one part, and return a list of integers representing the size of these parts.
Input
The input consists of one argument:
S: a string of lowercase letters
Output
Return a list of integers representing the size of these parts.
Note
-
Swill have length in range[1, 500]. -
Swill consist of lowercase English letters('a' to 'z')only.
Examples
Example 1:
Input:
S = "ababcbacadefegdehijhklij"
Output: [9,7,8]
Explanation
The partition is ababcbaca, defegde, hijhklij.
This is a partition such that each letter appears in at most one part.
A partition like ababcbacadefegde, hijhklij is incorrect because it splits S into fewer parts.