150强访谈简单

分区标签

“分区标签”问题的详细指南和 Python 实现。

问题陈述

简单

给你一个字符串 s。我们希望将字符串分成尽可能多的部分,以便每个字母最多出现在一个部分中。返回表示这些部分大小的整数列表。

编写一个函数 partitionLabels(s: str) -> List[int]

约束条件
  • 1 <= len(s) <= 500
  • s consists of lowercase English letters

示例

Example 1
Input
s = "ababcbacadefegdehijhklij"
Output
[9,7,8]
Explanation

The partition is "ababcbaca", "defegde", "hijhklij".

Example 2
Input
s = "eccbbbbdec"
Output
[10]
Explanation

All characters in 'eccbbbbdec' can only be in one group.

Need a Hint?
考虑使用特定于贪婪的数据结构,例如集合或堆。
Edge Cases to Watch
  • 空输入结构
  • 单元素输入
  • 大数值范围

准备好解决了吗?

Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.

在编辑器中打开
Found this breakdown helpful?

PyRun is built and maintained by an independent solo developer. If this helped your interview prep, consider buying a coffee!

Buy me a coffee

推荐的 Python 资源

通过相关的交互式教程、备忘单和代码比较来扩展您的知识。