题目描述
利用字符重复出现的次数,编写一个方法,实现基本的字符串压缩功能。比如,字符串“aabcccccaaa”经压缩会变成“a2b1c5a3”。若压缩后的字符串没有变短,则返回原先的字符串。
给定一个string iniString为待压缩的串(长度小于等于3000),保证串内字符均由大小写英文字母组成,返回一个string,为所求的压缩后或未变化的串。
测试样例
"aabcccccaaa"
返回:"a2b1c5a3"
"welcometonowcoderrrrr"
返回:"welcometonowcoderrrrr"
#include<iostream>
#include<string>#include<sstream>
using namespace std;
class Zipper{
public:
Zipper(){};
string zipString(string iniString){
int pre_length = iniString.length();
int count = 1;
if (pre_length <= 3000){
string zipString;
for (int i = 0; i < pre_length;){
for (int j = i + 1; j < pre_length; ++j){
if (iniString[j] == iniString[i])
{
++count;
}
else{
break;
}
}
zipString.push_back(iniString[i]);
stringstream ss;
ss << count;
string strcount = ss.str();
for (int i = 0; i < strcount.length(); ++i){
zipString.push_back(strcount[i]);
}
i = i + count;
count = 1;
}
int zip_length = zipString.length();
if (zip_length >= pre_length)
return iniString;
else
return zipString;
}
}
~Zipper(){};
};
void main()
{
string iniString;
cin >> iniString;
Zipper zipper;
string str = zipper.zipString(iniString);
cout << str << endl;
}