Encoding

Encoding

时间： 1ms        内存：64M

描述：

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.

输入：

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.

输出：

For each test case, output the encoded string in a line.

示例输入：

2
ABC
ABBCCC

示例输出：

ABC
A2B3C

提示：

参考答案（内存最优[752]）：

#include"stdio.h"
int main()
{
	int n,i,j,m;
	char a[10010]={'\0'},b;
	scanf("%d",&n);
	getchar();
	while(n--)
	{
		gets(a);
		for(i=0;a[i]!='\0';)
		{
			b=a[i];
			j=i;
			for(m=0;a[j]==b;m++,i++)
				j++;
			if(m!=1)
				printf("%d",m);
			printf("%c",b);
		}
		printf("\n");
	}
	return 0;
}

参考答案（时间最优[0]）：

#include"stdio.h"
int main()
{
	int n,i,j,m;
	char a[10010]={'\0'},b;
	scanf("%d",&n);
	getchar();
	while(n--)
	{
		gets(a);
		for(i=0;a[i]!='\0';)
		{
			b=a[i];
			j=i;
			for(m=0;a[j]==b;m++,i++)
				j++;
			if(m!=1)
				printf("%d",m);
			printf("%c",b);
		}
		printf("\n");
	}
	return 0;
}

题目和答案均来自于互联网，仅供参考，如有问题请联系管理员修改或删除。