Skip to content

Latest commit

 

History

History

0443-string-compression

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
 
 
 
 

Problem Description

Given an array of characters, compress it in-place.

The length after compression must always be smaller than or equal to the original array.

Every element of the array should be a character (not int) of length 1.

After you are done modifying the input array in-place, return the new length of the array.

Detail instruction can be found here.

Example 1:

Input:
["a","a","b","b","c","c","c"]

Output:
Return 6, and the first 6 characters of the input array should be: ["a","2","b","2","c","3"]

Explanation:
"aa" is replaced by "a2". "bb" is replaced by "b2". "ccc" is replaced by "c3".

Example 2:

Input:
["a"]

Output:
Return 1, and the first 1 characters of the input array should be: ["a"]

Explanation:
Nothing is replaced.

Example 3:

Input:
["a","b","b","b","b","b","b","b","b","b","b","b","b"]

Output:
Return 4, and the first 4 characters of the input array should be: ["a","b","1","2"].

Explanation:
Since the character "a" does not repeat, it is not compressed. "bbbbbbbbbbbb" is replaced by "b12".
Notice each digit has it's own entry in the array.

Solution

public int compress(char[] chars) {
    int read = 0, write = 0;
    
    while (read < chars.length) {
        int anchor = read + 1;
        
        while (anchor < chars.length && chars[read] == chars[anchor])
            anchor++;
        
        chars[write++] = chars[read];
        if (anchor - read > 1) {
            for (char c : ("" + (anchor - read)).toCharArray()) {
                chars[write++] = c;
            }
        }
        read = anchor;
    }
    
    return write;
}

This is only for discussion and communication. Please don't use this for submission of assignments.