标签：sort index partition 763 Labels parts intervals Medium ans

763. Partition Labels Medium 5066206Add to ListShare

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.

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.

Ideas: 其实跟[LeetCode] 56. Merge Intervals_Medium Tag: sort 原理一样，我们扫一遍s，得到每个char的first and last index， 然后再merge intervals， 最后返回intervals的差值加1即可。

 

Code:

class Solution:
    def partitionLabels(self, s: str) -> List[int]:
        d = collections.defaultdict(list)
        for index, c in enumerate(s):
            if not d[c] :
                d[c]= [index, index]
            else:
                d[c][-1] = index
        intervals = sorted(d.values())
        ans = []
        for s, e in intervals:
            if not ans or s >ans[-1][1]:
                ans.append([s, e])
            else:
                ans[-1][1] = max(ans[-1][1], e)
        return [e - s + 1 for s, e in ans]

 

标签：sort,index,partition,763,Labels,parts,intervals,Medium,ans
来源： https://www.cnblogs.com/Johnsonxiong/p/15073515.html

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。