[leetcode]763. Partition Labels

链接：https://leetcode.com/problems/partition-labels/description/

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:

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

class Solution {
public:
    vector<int> partitionLabels(string s) {
        int last[26];
        int length = s.size();
        for (int i = 0; i < length; i++) {
            last[s[i] - 'a'] = i;
        }
        vector<int> partition;
        int start = 0, end = 0;
        for (int i = 0; i < length; i++) {
            end = max(end, last[s[i] - 'a']);
            if (i == end) {
                partition.push_back(end - start + 1);
                start = end + 1;
            }
        }
        return partition;
    }
};

class Solution {
public:
    vector<int> partitionLabels(string S) {
        vector<int> r;
        int pos[26]={};
        
        for(int i=0;i<S.size();i++)
        {
            pos[S[i]-'a']=i;
        }
        
        for(int i=0;i<S.length();i++)
        {
            int old=i;
            
            for(int j=old;j<=pos[S[i]-'a'];j++)
            {
                i=max(i,pos[S[j]-'a']);
            }
            r.push_back(i-old+1);
        }
        return r;
    }
};