https://leetcode.cn/problems/string-compression/
懈怠了几天马上被拷打
class Solution {
public:
int compress(vector<char>& chars) {
string result;
int cnt=1;
for(int i=0;i<chars.size()-1;i++){
if(chars[i]!=chars[i+1]){
result.push_back(chars[i]);
if(cnt>1) result.append(to_string(cnt));
cnt=1;
}else{
cnt++;
}
}
result.push_back(chars[chars.size()-1]);
if(cnt>1) result.append(to_string(cnt));
for(int i=0;i<result.size();i++){
chars[i]=result[i];
}
return result.size();
}
};