763. Partition Labels(Leetcode每日一题-2020.10.22)

Problem

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.

Note:

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

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

class Solution {
public:
    vector<int> partitionLabels(string S) {
        unordered_map<char,int> hash;
        for(int i = 0;i<S.length();++i)
            hash[S[i]] = i;
        vector<int> ret;
        int i = 0;
        while(i < S.length())
        {
           int r = hash[S[i]];

           for(int j = i+1;j<=r;++j)
           {
               r = max(r,hash[S[j]]);
           }
            ret.push_back(r-i + 1);
            i = r+1;
        }

        return ret;

    }
};