/*Encoding
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 30734 Accepted Submission(s): 13609
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.
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
Recommend
JGShining | We have carefully selected several similar problems for you: 1019 1021 1062 1032 1039
*/
#include<stdio.h>
#include<string.h>
char s1[10010];
int main()
{
int n, i, j, k;
scanf("%d", &n);
getchar();
while(n--)
{
gets(s1);//输入字符串
int l = strlen(s1);
j = 1;
k = 0;
for(i = 1; i <= l; ++i)
{
if(s1[i] != s1[i-1])
{
if(j != 1)//1不用输出
printf("%d", j);
printf("%c", s1[i-1]);
j = 1;//初始化
}
else
j++;
}
printf("\n");
}
return 0;
}
题意:给出一个字符串,将连续的相同的字符简化为“KX”,k为字符的个数,X为该字符。注意这个连续,并且输出的时候是不用按字典序排序的。不要多次一举。