# LeetCode-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.

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.

输入:
["a","a","b","b","c","c","c"]

"aa" 被替换为 "a2". "bb" 被替换为 "b2". "ccc" 被替换为 "c3".

输入:
["a"]

输入:
["a","b","b","b","b","b","b","b","b","b","b","b","b"]

Explanation:

C++代码（Visual Studio 2017）：

#include "stdafx.h"
#include <iostream>
#include <vector>
#include <map>
#include <string>
using namespace std;

class Solution {
public:
int compress(vector<char>& chars) {
/*map是无序的，并且题意要求不能开辟额外空间
map<char, int> m;
string result="";
for (int i = 0; i < chars.size(); i++) {
m[chars[i]]++;
}
map<char, int>::iterator it;
for (it = m.begin(); it != m.end(); it++) {
if (it->second <= 1)
result += it->first;
else
result += it->first+to_string(it->second);
}
cout << result<<" ";
return result.size();
*/
int n = chars.size(), cur = 0;
for (int i = 0, j = 0; i < n; i = j) {
while (j < n &&chars[j] == chars[i])
j++;
chars[cur++] = chars[i];
if (j - i == 1)
continue;
for (char c : to_string(j - i))
chars[cur++] = c;
}
for (int i = 0; i < chars.size(); i++) {
cout << chars[i] << " ";
}
return cur;
}
};

int main()
{
Solution s;
vector<char> chars = { 'a' , 'b', 'b' ,  'b' ,  'b' ,  'b' , 'b' , 'b' ,  'b' ,  'b' ,  'b' , 'b' ,  'b'  };
//vector<char> chars = { 'a','a','b','b','c','c','c' };
int result;
result = s.compress(chars);
cout << result;
return 0;
}

• 广告
• 抄袭
• 版权
• 政治
• 色情
• 无意义
• 其他

120