HDU 1020 Encoding

最新推荐文章于 2019-09-17 21:06:21 发布

原创最新推荐文章于 2019-09-17 21:06:21 发布 · 375 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一种针对仅包含A-Z字符的字符串进行高效编码的方法。通过识别并压缩连续相同的字符，实现字符串的简洁表示。

Encoding
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u

Description
Given a string containing only ‘A’ - ‘Z’, we could encode it using the following method:

Each sub-string containing k same characters should be encoded to “kX” where “X” is the only character in this sub-string.
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

题目大意：给一只包含A到Z的字符串，要求找出其中连续相同（不是统计该字母在字符串出现的总次数!!!）的字母的个数，并按格式输出。

代码：

#include<stdio.h>
#include<string.h>
#define M 100005
int main()
{
    int i,n,cnt=1;
    char str[M];
    scanf("%d",&n);
    while(n--){
        scanf("%s",&str);
        for(i=0;i<strlen(str);i++){
            if(str[i]==str[i+1]) cnt++;
            else{
                if(cnt<=1){
                    printf("%c",str[i]);
                    cnt = 1;
                }
                else{
                    printf("%d%c",cnt,str[i]);
                    cnt = 1;
                }
            }
        }
        printf("\n");
    }
    return 0;
}