HDU 1020 Encoding字符串编码

Encoding

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

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
   
   
   
   

    
    

   
   
   
   

    
    题解：统计连续字符串问题。需设一个统计量count，这里需要注意初始值为1而不是0，将后一个字符与前一个比较，相同则变量加1，最后输出的时候，大于1的count才输出，此时需要判断。另外每次输出都要重新设为1，否则会混淆后面的数值。
   
   
   
   

    
    
<span style="background-color: rgb(255, 255, 255);">#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<ctype.h>
int main()
{
	int T,i,j,len,count=1;
	char str[10000];
	scanf("%d",&T);
	while(T--)
	{
		scanf("%s",str);
		len=strlen(str);
		for(i=0;i<len;i++)
		{
			if(str[i]==str[i+1])
			count++;
			else
			{
				if(count>1)
				printf("%d",count);
				printf("%c",str[i]);
				count=1; 
			}
			
		}
		count=1;
		printf("\n");
	}
	
	return 0;
}
</span>