Scribd
Upload
56 views

String Compression Solution

The document describes a string compression algorithm that compresses consecutive repeating characters in a character array. It groups repeating characters and replaces the group with the character and number of repetitions. If the number is 10 or more, it is split into multiple characters. The algorithm modifies the input array in-place and returns the new length. It uses only constant extra space.

Uploaded by

DD
Copyright
© © All Rights Reserved
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
56 views

String Compression Solution

The document describes a string compression algorithm that compresses consecutive repeating characters in a character array. It groups repeating characters and replaces the group with the character and number of repetitions. If the number is 10 or more, it is split into multiple characters. The algorithm modifies the input array in-place and returns the new length. It uses only constant extra space.

Uploaded by

DD
Copyright
© © All Rights Reserved
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 2

String Compression

Given an array of characters chars, compress it using the following algorithm:


Begin with an empty string s. For each group of consecutive repeating
characters in chars:
* If the group's length is 1, append the character to s.
* Otherwise, append the character followed by the group's length.
The compressed string s should not be returned separately, but instead, be
stored in the input character array chars. Note that group lengths that are 10 or
longer will be split into multiple characters in chars.
After you are done modifying the input array, return the new length of the array.
You must write an algorithm that uses only constant extra space.

Example 1:
Input: chars = ["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: The groups are "aa", "bb", and "ccc". This compresses to "a2b2c3".
Example 2:
Input: chars = ["a"]
Output: Return 1, and the first character of the input array should be: ["a"]
Explanation: The only group is "a", which remains uncompressed since it's a single
character.
Example 3:
Input: chars = ["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: The groups are "a" and "bbbbbbbbbbbb". This compresses to "ab12".

Constraints:
* 1 <= chars.length <= 2000
* chars[i] is a lowercase English letter, uppercase English letter, digit, or
symbol.

https://leetcode.com/problems/string-compression/description/
https://www.youtube.com/watch?v=IhJgguNiYYk&ab_channel=KevinNaughtonJr

- Two pointers, one goes element by element and second runs forward and counts
adjacent equal numbers
- If we have “i” and “j” as outer pointer and respectively inner pointer - when j
finished counting occurrences we will add the element at position “i” in the
result, then will need to check if the number of occurrences is greater than
1( i.e. j-i>1) which means that we need to perform compression
- We will then convert the frequency count into a string so that we can parse it
char by char from left to right and add each digit to the result
- We will then need to update I to point to J at the last line of the loop

class Solution {
public int compress(char[] chars) {
int k=0;
int i=0;
while(i<chars.length){
int j = i;
while(j<chars.length && chars[i] == chars[j]){
j++;
}
chars[k++] = chars[i];
if(j-i > 1){
String freq = (j - i) + "";
for(char c : freq.toCharArray()){
chars[k++] = c;
}
}
i = j;
}
return k;
}
}

#Leetcode #Java #Medium #Arrays

You might also like