763. Partition Labels

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.

思路：

1.两个string，一个正向查找字符，一个逆向查找对应字符的最后出现位置，但实质上是只需要知道某个字符最后出现的位置（重点）

2.利用map记录某个字符最后出现的位置，利用head和tail两个变量遍历区间内的元素，其中tail可能随着head变化

代码1：

class Solution {
public:
    vector<int> partitionLabels(string s) {
        map<char,int> m;
        int i=0,head=0,tail=0;
        vector<int> res;
        for(char ch:s){
            m[ch]=i;
            i++;
        }
        for(i=0;i<s.size();i++){
            if(m[s[i]]>tail){tail=m[s[i]];}
            if(i==tail){
                res.push_back(tail-head+1);
                head=tail+1;
            }
        }
        return res;
    }
};

代码2：

class Solution {
public:
    vector<int> partitionLabels(string S) {
        map<char,int> m;
        vector<int> res;
        for(int i=0;i<S.size();i++){m[S[i]]=i;}//记录一个字符最后出现的位置
        int head=0,tail=0;
        while(head<S.size()){
            for(int i=head;i<=tail;i++){
                if(m[S[i]]>tail){tail=m[S[i]];}
            }
            res.push_back(tail-head+1);
            head = tail+1;
            if(head<S.size()){tail=m[S[head]];}
            //若无词句，更新后的head将大于tail，for循环进不去
        }
        return res;
    }
};