<del id="so2yo"></del>

leetcode443. String Compression

nifhlheimr 發(fā)布于2019-08-16 16:41 / 1165人閱讀

摘要：題目要求對(duì)字符串進(jìn)行簡(jiǎn)單的壓縮操作，壓縮的規(guī)則是，如果出現(xiàn)多個(gè)重復(fù)的字母，則用字母加上字母出現(xiàn)的字?jǐn)?shù)進(jìn)行表示。如果字母只出現(xiàn)一次，則不記錄次數(shù)。

題目要求

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.

對(duì)字符串進(jìn)行簡(jiǎn)單的壓縮操作，壓縮的規(guī)則是，如果出現(xiàn)多個(gè)重復(fù)的字母，則用字母加上字母出現(xiàn)的字?jǐn)?shù)進(jìn)行表示。如果字母只出現(xiàn)一次，則不記錄次數(shù)。

思路和代碼

核心思路是用三個(gè)指針?lè)謩e記錄三個(gè)下標(biāo)：
p1: 記錄壓縮后的內(nèi)容的插入下標(biāo)
p2: 記錄當(dāng)前相同字符串的起始位置
p3: 記錄當(dāng)前和起始位置比較的字符串的位置

一旦出現(xiàn)p3的值不等于p2或是p3的值大于字符數(shù)組的長(zhǎng)度，則將壓縮結(jié)果從p1開(kāi)始填寫(xiě)，實(shí)現(xiàn)O(1)的空間復(fù)雜度。

    public int compress(char[] chars) {
        int p1 = 0;
        int p2 = 0;
        int p3 = 1;
        while(p2 < chars.length) {
            if(p3 >= chars.length || chars[p3] != chars[p2]) {
                int length = p3 - p2;
                chars[p1++] = chars[p2];
                if(length != 1) {
                    int count = 0;
                    while(length != 0) {
                        int num = length % 10;
                        for(int i = p1+count ; i>p1 ; i--) {
                            chars[i] = chars[i-1];
                        }
                        chars[p1] = (char)("0" + num);
                        length /= 10;
                        count++;
                    }
                    p1 += count;
                }
                p2 = p3;
            }
            p3++;

        }
        return p1;
    }