HDOJ 1020 Encoding-CSDN博客

本文链接：https://blog.csdn.net/eof_2011/article/details/17483861

Encoding

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 23174 Accepted Submission(s): 10158

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

Author

ZHANG Zheng

代码：

// Title : Encoding
// Addr : http://acm.hdu.edu.cn/showproblem.php?pid=1020
// Date : 2013-12-22 11:14:46

#include <stdio.h>
#include <string.h>

int main()
{
	int N; // N Line
	while(scanf("%d", &N) != EOF)
	{
		char * data = new char[10005];
		scanf("%s", data);
		int len = strlen(data);
		char cur = data[0];
		int cnt = 1;
		for(int i = 1; i < len; i++)
		{
			char tmp = data[i];
			if(tmp == cur)
			{
				cnt++;
			}
			else
			{
				if(cnt == 1)
					printf("%c", cur);
				else
					printf("%d%c", cnt, cur);
				cur = tmp;
				cnt = 1;
			}
		}
		if(cnt == 1)
			printf("%c", cur);
		else
			printf("%d%c", cnt, cur);
		printf("\n");
	}
    return 0;
}