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.

输入 

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.

Sample

Inputcopy	Outputcopy
2 ABC ABBCCC	ABC A2B3C

解题思路 ：字符串编码问题，统计连续相同的字符，而不是求一个字符串中所有相同的字符

比较前一个字符与当前字符比较，如果相同，m加1，初始时m为1，如果比较后m=1，就不输出数字，否则输出数字

#include<stdio.h>
#include<string.h>
char a[10005];
int main(void)
{
	int n;
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%s",a);
		int m=1;
		for(int j=1;j<=strlen(a);j++)
		{
			if(a[j-1]==a[j])
			m++;
		    else
		    {
			if(m==1)
		 	printf("%c",a[j-1]);
	        else
	        {
	        printf("%d%c",m,a[j-1]);
	        m=1;//重置1
	        }
	        }
	    }
	    printf("\n");
    }
    return 0;
}