HDU1020——Encoding

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

题解：

#include<stdio.h>
#include<string.h>
char a[10001],c[10001];    
int b[10001];
int main()
{
	int n,k;
	scanf("%d",&n);
	while(n--)
	{
		getchar();
		memset(b,0,sizeof(b));
		memset(c,0,sizeof(c));
		scanf("%s",a);
		int l=0;
		for(int j=0;a[j] != '\0';j++)
		{
			if(a[j] == a[j+1])
				b[l]++;                //这个记录连续且相同的个数； 
			if(a[j] != a[j+1])
			{
				c[l]=a[j];             //这个记录连续的字符；
				l++; 
			}
		}
		for(int m=0; c[m] != '\0'; m++)
		{
			if(b[m]>0)
				printf("%d",b[m]+1);    //因为每个连续段的第一个字符都没算上，所以要在这里加上1；
			printf("%c",c[m]);
		}
		printf("\n");
	}
	return 0;
}