[LeetCode]Partition Labels@Python

Partition Labels
A string S of lowercase letters is given. 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.

Example
Input: S = “ababcbacadefegdehijhklij”
Output: [9,7,8]
Explanation:
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.

Solution

# follow the greedy principle to promote the boundary
class Solution:
    def partitionLabels(self, S: str) -> List[int]:
        dict = {}
        for i,v in enumerate(S):
            dict[v]=i
        
        ret = []
        count = 0
        boundary = 0
        
        for i,v in enumerate(S):
            boundary= max(boundary, dict[v])
            count += 1
            if i==boundary:
                ret.append(count)
                count = 0
        return ret