HDOJ1020. Encoding（字符计数）

Encoding

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 51196    Accepted Submission(s): 22809

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
  
  

【分析】字符计数

        题意：读入N个长度<=10000字符串，将同一个字符'X'组成的子串合并为k‘X’输出，其中k为‘X’出现的次数。若k>=2，则输出k'X'，否则输出‘X’。注意这里考察的对象是相邻字符。

#include <stdio.h>
#include <string.h>
#define maxlen 10010
int N;
char str[maxlen];
int main()
{
	int i,j;
	int len,ans;
	scanf("%d",&N);
	for(i=0;i<N;i++)
	{
		scanf("%s",str);
		len=strlen(str);
		j=0;
		while(j<len)
		{
			ans=1;    //字符str[j]出现次数 
			while(j+1<len && str[j+1]==str[j])
			{
				ans++;
				j++;
			}
			//注意先打印次数(若>=2)，再打印字符'X' 
			if(ans>=2)
				printf("%d",ans);
			printf("%c",str[j]);
			j++;
		}
		printf("\n");
	}
	return 0;
}