763 Partition Labels

1 题目

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.

2 尝试解

2.1 分析

给定一个由小写字母组成的字符串，要求将其分为尽量多个区间，每种字母最多只在一个区间内出现。

首先记录每种字母出现的区间，然后从左向右遍历字符串，用right记录当前区间的右端，遍历当前区间；对于每一个字母，比较该字母的区间右端与当前区间的右端，如果前者大则扩展区间，如果二者相等，当前区间结束，开始下一个区间。

2.2 代码

class Solution {
public:
    vector<int> partitionLabels(string S) {
        vector<int> interval(26,0);
        for(int i = 0; i < S.size(); i++){
            interval[S[i]-'a'] = i;
        }
        vector<int> result{-1};
        int right = 0;
        for(int i = 0; i < S.size(); i++){
            right = max(interval[S[i]-'a'],right);
            if(right == i)
                result.push_back(right);
        }
        for(int i = result.size()-1; i > 0; i--)
            result[i] -= result[i-1];
        result.erase(result.begin());
        return result;
    }
};

3 标准解

class Solution {
public:
    vector<int> partitionLabels(string S) {
        vector<int> res, pos(26, 0);  
        for (auto i = 0; i < S.size(); ++i) pos[S[i] - 'a'] = i;
        for (auto i = 0, idx = INT_MIN, last_i = 0; i < S.size(); ++i) {
            idx = max(idx, pos[S[i] - 'a']);
        if (idx == i) res.push_back(i - exchange(last_i, i + 1) + 1);
        }
        return res;
    }
};