63 lines
1.2 KiB
Markdown
63 lines
1.2 KiB
Markdown
# Leetcode Partition-Labels
|
|
|
|
2022-09-06 13:46
|
|
|
|
> ##### Algorithms:
|
|
>
|
|
> #algorithm #greedy
|
|
>
|
|
> ##### Data structures:
|
|
>
|
|
> #DS #hash_table
|
|
>
|
|
> ##### Difficulty:
|
|
>
|
|
> #coding_problem #difficulty-medium
|
|
>
|
|
> ##### Additional tags:
|
|
>
|
|
> #leetcode
|
|
>
|
|
> ##### Revisions:
|
|
>
|
|
> N/A
|
|
|
|
##### Links:
|
|
|
|
- [Link to problem](https://leetcode.com/problems/partition-labels/)
|
|
|
|
---
|
|
|
|
### Problem
|
|
|
|
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_.
|
|
|
|
#### Examples
|
|
|
|
**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
|
|
|
|
### Thoughts
|
|
|
|
> [!summary]
|
|
> This is a #template_remove_me
|
|
|
|
### Solution
|