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.


def partition_labels(s):
    last = {c: i for i, c in enumerate(s)}
    ans = []
    j = anchor = 0
    for i, c in enumerate(s):
        j = max(j, last[c])
        if i == j:
            ans.append(i - anchor + 1)
            anchor = i + 1
    return ans
