443. String Compression

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.

https://leetcode.com/problems/string-compression/

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.

Test Cases

1
2

class Solution:
    def compress(self, chars: List[str]) -> int:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16

import pytest

from solution import Solution


@pytest.mark.parametrize('chars, expected, result', [
    (["a","a","b","b","c","c","c"], 6, ["a","2","b","2","c","3"]),
    (["a"], 1, ["a"]),
    (["a","b","b","b","b","b","b","b","b","b","b","b","b"], 4, ["a","b","1","2"]),
])
class Test:
    def test_solution(self, chars, expected, result):
        sol = Solution()
        chars = chars.copy()
        assert sol.compress(chars) == expected
        assert chars == result

Thoughts

Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23

class Solution:
    def compress(self, chars: list[str]) -> int:
        n = len(chars)
        write = 0
        prev = ''
        cnt = 0
        for i in range(n + 1):
            if i < n and (c := chars[i]) == prev:
                cnt += 1
                continue

            if cnt > 1:
                for d in str(cnt):
                    chars[write] = d
                    write += 1

            if i < n:
                chars[write] = prev = c
                write += 1
                cnt = 1

        del chars[write:]
        return len(chars)

参考资料

• 反向引用

  • 1531. String Compression II

许可协议

本文除了题目描述（Problem）部分之外，其他内容由 Calf 原创，采用 CC BY-NC-SA 4.0 许可协议，转载请注明出处。

分享文章