[leetcode] 763. Partition Labels @ python

原题

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 1:
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.
Note:

S will have length in range [1, 500].
S will consist of lowercase letters (‘a’ to ‘z’) only.

解法

参考: 【LeetCode】763. Partition Labels 解题报告（Python & C++）
使用字典d保存每个字符的最右边的位置, 然后遍历S, 如果i等于该字符的最右的位置, 说明已经找到一个划分的末尾. 然后更新左指针的位置.
Time: O(n)
Space: O(1)

代码

class Solution:
    def partitionLabels(self, S: 'str') -> 'List[int]':
        d = {}
        for i, char in enumerate(S):
            d[char] = i
            
        left, right = 0, 0
        res = []
        
        for i, char in enumerate(S):
            right = max(right, d[char])
            if i == right:
                # we reach the right-most index
                res.append(right-left+1)
                left = right + 1
                
        return res