字符串转化

将字符串转化为原来字符串里的字符+该字符连续出现的次数，例如字符串1233422222，转化为1121324125

int main() { string s; char res[100] = {'0'}; cin >> s; int l = s.size(); int count = 1,index=0; for (int i = 0; i < l-1; ) { if (s[i] == s[i + 1]) { count++; i++; } else { res[index++] = s[i]; res[index++] = count + '0'; count = 1; i++; } } if (s[l - 1] == s[l - 2]) { res[index++] = s[l-2]; res[index++] = count + '0'; } else { res[index++] = s[l - 1]; res[index++] = '0' + 1; } for (int i = 0; i <= index; i++) cout << res[i]; return 0; }