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 資源

透過相關的互動式教學、備忘單和程式碼比較來擴展您的知識。