Encoding
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 34610 Accepted Submission(s): 15337
Problem Description
Given a string containing only 'A' - 'Z', we could encode it using the following method:
1. Each sub-string containing k same characters should be encoded to "kX" where "X" is the only character in this sub-string.
2. If the length of the sub-string is 1, '1' should be ignored.
1. Each sub-string containing k same characters should be encoded to "kX" where "X" is the only character in this sub-string.
2. If the length of the sub-string is 1, '1' should be ignored.
Input
The first line contains an integer N (1 <= N <= 100) which indicates the number of test cases. The next N lines contain N strings. Each string consists of only 'A' - 'Z' and the length is less than 10000.
Output
For each test case, output the encoded string in a line.
Sample Input
2 ABC ABBCCC
Sample Output
ABC A2B3c********** 字符串,遇到相邻相同字符计数。#include "iostream" #include "cstring" using namespace std; #define maxn 10005int main() { char s[maxn]; int t,p,q; cin >> t; while(t--) { cin >> s; p = 0;//p,q作为标记 q = 0; while(1) { int len = 1; //计数器,记录相邻相同字符数量 while(s[q+1] == s[p]) { len++; q++; } if(len > 1) cout << len; // 大于一个时输出数量 cout << s[p]; // 输出字符 p = q+1; q = p; if(p >= strlen(s)) break; } cout << endl; }return 0; }