贪心字符串分割

763. Partition Labels

Medium

88748FavoriteShare

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.

class Solution {
public:
    vector<int> partitionLabels(string S) {
        unordered_map<char,int> HashMap;
        vector<int> Result;
        for(int i = 0;i < S.length();i++){
            HashMap[S[i]] = i;
        }
        int EndIndex = 0,StartIndex = 0;
        for(int i = 0;i < S.length();i++){
            EndIndex = max(EndIndex,HashMap[S[i]]);
            if(i == EndIndex){
                Result.push_back(EndIndex - StartIndex + 1);
                StartIndex = EndIndex + 1;
            }
        }
        return Result;
    }
};

这道题太难想了，哎。。。