python压缩字符串中连续出现的字符_压缩字符串（将连续出现的字符转换为字符+个数）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.

解决：

①  双指针。

class Solution { //10ms

public int compress(char[] chars) {

int index = 0;

int cur = 1;

int count = 1;

while(cur < chars.length){

if (chars[cur] == chars[cur - 1]){

count ++;

}else{

chars[index ++] = chars[cur - 1];

if (count >= 2){

char[] tmp = String.valueOf(count).toCharArray();

for (int i = 0;i < tmp.length;i ++){

chars[index ++] = tmp[i];

}

}

count = 1;

}

cur ++;

}

chars[index ++] = chars[chars.length - 1];

if (count >= 2){

char[] tmp = String.valueOf(count).toCharArray();

for (int i = 0;i < tmp.length;i ++){

chars[index ++] = tmp[i];

}

}

return index;

}

}

② 在discuss中看到的。

class Solution {//8ms

public int compress(char[] chars) {

int index = 0;

int i = 0;

while(i < chars.length) {

char currentChar = chars[i];

int count = 0;

while(i < chars.length && chars[i] == currentChar) {

i ++;

count ++;

}

chars[index ++] = currentChar;

if(count != 1) {

for(char c : Integer.toString(count).toCharArray()) {

chars[index ++] = c;

}

}

}

return index;

}

}