443. String Compression*

443. String Compression*

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

题目描述

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.

Follow up:
Could you solve it using only $O(1)$ extra space?

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.

Note:

• All characters have an ASCII value in [35, 126].
• 1 <= len(chars) <= 1000.

C++ 实现 1

这道题被给了大量的差评:

感觉是因为题目没有描述清楚, 我一开始以为这道题只需要用 Hash 表来做特别简单, 但实际上是不行的. 我通过运行一个自己的测试用例来验证:

["a","b","a","b","c","c","c"]

## 得到的结果是:
["a","b","a","b","c","3"]

这结果说明不能对输入列表进行排序或者利用 Hash 保存其中的字符, 应该对其进行遍历. 因此我采用双指针来做.

chars[i, ..., j] 中保存的是字符(注意是 char 而不是 string, 题目的例子用双引号引用字母, 不太严谨)是相同的, 只有当这个子序列的大小大于 1 才需要额外的处理. 使用额外的 k 来指示当前哪些位置可以保存输出结果.

class Solution {
public:
    int compress(vector<char>& chars) {
        int k = 0;
        for (int i = 0; i < chars.size(); ++ i) {
            int j = i;
            while (j + 1 < chars.size() && chars[j + 1] == chars[j]) ++ j;
            int count = j - i + 1;
            chars[k++] = chars[i];
            if (count > 1) {
                string s_count = std::to_string(count);
                for (int n = 0; n < s_count.size(); ++ n)
                    chars[k++] = s_count[n];
            }
            i = j;
        }
        return k;
    }
};