1020-CSDN博客

本文链接：https://blog.csdn.net/tookkke/article/details/50334317

Encoding

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

Problem 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

 这算是字符串合并吗，就是把连续的字符合在一起，就只用读数据的时候存储上一个字符和他重复的次数。
 1. 如果当前数与上一个相同，则重复的次数+1
 2. 如果当前数与上一个数不同，只用按题意输出上一个数，然后把记录的字符和次数改成当前字符的就行了

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

int main()
{
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    int n;
    char a,b;
    int cnt;
    scanf("%d",&n);
    while(n--)
    {
        scanf(" %c",&b);cnt=1;
        while((a=getchar())!='\n'&&a!=EOF)
        {
            if(a==b)cnt++;
            else
            {
                if(cnt>1)printf("%d",cnt);
                putchar(b);
                cnt=1;
                b=a;
            }
        }
        if(cnt>1)printf("%d",cnt);
        putchar(b);
        putchar('\n');
    }
    return 0;
}