LeetCode763. Partition Labels

本文主要是介绍LeetCode763. Partition Labels，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

一、题目

You are given a string s. We want to partition the string into as many parts as possible so that each letter appears in at most one part.

Note that the partition is done so that after concatenating all the parts in order, the resultant string should be s.

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.
Example 2:

Input: s = “eccbbbbdec”
Output: [10]

Constraints:

1 <= s.length <= 500
s consists of lowercase English letters.

二、题解

class Solution {
public:vector<int> partitionLabels(string s) {int n = s.size();vector<int> map(26,0);//记录字符出现的最远位置的下标for(int i = 0;i < n;i++){map[s[i]-'a'] = i;}vector<int> res;int left = 0,right = 0;for(int i = 0;i < n;i++){right = max(map[s[i]-'a'],right);if(i == right){res.push_back(right-left+1);left = i + 1;}}return res;}
};

这篇关于LeetCode763. Partition Labels的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---