# 763. Partition Labels**

https://leetcode.com/problems/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:

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

## C++ 实现 1

class Solution {
public:
vector<int> partitionLabels(string S) {
unordered_map<char, int> record;
vector<int> res;
for (int i = 0; i < S.size(); ++ i) record[S[i]] = i;
int i = 0;
while (i < S.size()) {
int j = i;
int limit = record[S[i]];
while (j < limit) {
limit = std::max(record[S[j]], limit);
++ j;
}
res.push_back(j + 1 - i);
i = ++ j;
}
return res;
}
};


©️2019 CSDN 皮肤主题: 大白 设计师: CSDN官方博客