[LeetCode / Medium] 443. String Compression (Java)

💬 Info

• 난이도 : Medium
• 문제 링크 : https://leetcode.com/problems/string-compression
• 풀이 링크 : LeetCode/Medium/String Compression.java

Problem

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".
  
  

예시 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.

예시 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.

문제 이해

• 알파벳 - 숫자 - 알파벳 - 숫자
  • 알파벳은 같은 것이 나올 수 있음

알고리즘

풀이 시간 : 12분

• 배열 : 연속된 문자의 개수 세기
• 새로운 위치(idx)에 문자 저장 -> 개수가 2 이상이면 숫자로 변환해 저장

class Solution {
    public int compress(char[] chars) {
        int idx = 0, cnt = 1;
        
        for (int i = 1; i <= chars.length; i++) {
            if (i < chars.length && chars[i] == chars[i - 1]) {
                cnt++;
            } else {
                chars[idx++] = chars[i - 1];
                if (cnt > 1) {
                    for (char c : String.valueOf(cnt).toCharArray()) {
                        chars[idx++] = c;
                    }
                }
                cnt = 1;
            }
        }
        return idx;
    }
}

결과