HDU1020——Encoding

最新推荐文章于 2021-04-27 21:28:59 发布

sdljtyk

最新推荐文章于 2021-04-27 21:28:59 发布

阅读量886

点赞数

分类专栏： HDU 水题文章标签： HDU1020 Encoding 模拟统计字符串

本文链接：https://blog.csdn.net/LDUtyk/article/details/53304156

版权

HDU 同时被 2 个专栏收录

54 篇文章 0 订阅

订阅专栏

水题

37 篇文章 2 订阅

订阅专栏

Encoding

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

Total Submission(s): 42173 Accepted Submission(s): 18642

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

题意：

给定一个字符串，统计不同字符出现的次数，如果该字符出现次数大于1，就将后面的所有该字符换成该字符的数量。

解：

简单模拟一下就好。

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

char a[10005];

int main()
{
    memset(a,0,sizeof(a));

    int n;
    while(~scanf("%d",&n))
    {
        getchar();
        while(n--)
        {
            gets(a);
            int len=strlen(a);
            int count=0;
            for(int i=0;i<len;i++)
            {
                if(a[i]!=a[i+1])
                {
                    if(count>0)
                    {
                        printf("%d",count+1);
                    }
                    printf("%c",a[i]);
                    count=0;
                }
                else{
                    count++;
                }
            }
            printf("\n");
        }
    }
    return 0;
}