LeetCode 763. Partition Labels

题目：

A string S of lowercase English 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 English letters ('a' to 'z') only.

---

Runtime: 3 ms, faster than 84.46% of Java online submissions for Partition Labels.

Memory Usage: 38 MB, less than 80.89% of Java online submissions for Partition Labels.

class Solution {
    public List<Integer> partitionLabels(String S) {
        int[] chars = new int[26];
        Arrays.fill(chars, -1);
        for (int i = 0; i < S.length(); i++) {
            chars[S.charAt(i) - 'a'] = i;
        }
        
        List<Integer> result = new ArrayList<>();
        int tempStart = 0, tempMax = 0;
        for (int i = 0; i < S.length(); i++) {
            tempMax = Math.max(tempMax, chars[S.charAt(i) - 'a']);
            if (i == tempMax) {
                result.add(tempMax - tempStart + 1);
                tempStart = i + 1;
            }
        }
        
        return result;
    }
}