First record the last position at which each character appears in the string.

Partition Labels

medium

Acceptance: 54%

GreedyStringsTwo Pointers

Split a string into the maximum number of contiguous segments such that every character appears in at most one segment. Return the lengths of those segments in order.

Examples

Example 1:

Input:s = "xyzxabcabc"

Output:[4,6]

Example 2:

Input:s = "abcabc"

Output:[6]

Hints

1234567

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

Partition Labels

Examples

Hints

Related Problems