Encoding
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 53023 Accepted Submission(s): 23515
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
Author
ZHANG Zheng
答案:
#include <stdio.h>
#include <string.h>
void main()
{
int n;
char aa[10001];
int len;
int i;
int count;
char bb;
scanf("%d",&n);
while (n--)
{
scanf("%s",&aa);
len = strlen(aa);
bb = aa[0];
count = 0;
for(i=0;i<len;i++)
{
if(aa[i]!=bb)
{
if(count==1)
printf("%c",bb);
else
printf("%d%c",count,bb);
bb = aa[i];
count =1;
}
else
{
count++;
}
}
if(count==1)
printf("%c",bb);
else
printf("%d%c",count,bb);
printf("\n");
}
}
解析:
一次遍历统计,遇到不同字符就输出前面统计的结果