Search

Partition Labels

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.

Solution:

class Solution {
    public List<Integer> partitionLabels(String s) {
        int[] last  = new int[26];
        for(int i=0;i<s.length();i++)
        {
            last[s.charAt(i)-'a'] = i;
        }
        int j=0, anchor = 0;
        List<Integer> ans = new ArrayList();
        
        for(int i=0;i<s.length();i++)
        {
            j = Math.max(j,last[s.charAt(i)-'a']);
            if(i==j)
            {
                ans.add(i-anchor+1);
                anchor=i+1;
            }
                
        }
        
        return ans;
        
    }
}

6 views0 comments

Recent Posts

See All

A string s is called good if there are no two different characters in s that have the same frequency. Given a string s, return the minimum number of characters you need to delete to make s good. The f

The numeric value of a lowercase character is defined as its position (1-indexed) in the alphabet, so the numeric value of a is 1, the numeric value of b is 2, the numeric value of c is 3, and so on.