题面:
763. Partition Labels
Medium
96954FavoriteShare
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.
题意:给定一个字符串,其中仅包含小写字母,要求将其分割成尽可能多的串,让每种字符仅包含在一个串中。
解题:
记录每个串的最左和最右位置,排个序即可。注意边界处理。
代码:
struct letter{
int p1,p2;
};
bool cmp(letter a,letter b){
return a.p1<b.p1;
}
class Solution {
public:
vector<int> partitionLabels(string S) {
letter le[26];
vector <int> res;
for(int i=0;i<26;i++){
le[i].p1=le[i].p2=-1;
}
for(int i=0;i<=S.length()-1;i++){
if(le[S[i]-'a'].p1==-1){
le[S[i]-'a'].p1=i;
}
else{
le[S[i]-'a'].p2=i;
}
}
for(int i=0;i<26;i++){
if(le[i].p2==-1)
le[i].p2=le[i].p1;
}
sort(le,le+26,cmp);
int right=-1,left;
for(int i=0;i<26;i++){
if(le[i].p1==-1)
continue;
else{
if(le[i].p1>right)
{
if(right!=-1)
res.push_back(right-left+1);
right=le[i].p2;
left=le[i].p1;
}
else{
right=max(right,le[i].p2);
}
}
}
res.push_back(right-left+1);
return res;
}
};