ACM--字母序列--HDOJ 1020--Encoding--字符串

HDOJ 题目地址：传送门

Encoding

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

Total Submission(s): 39606    Accepted Submission(s): 17517

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

2ABCABBCCC

 

Sample Output

ABCA2B3C

 

题解：字符串打印的水题，模拟就可以了

#include<stdio.h>#include<iostream>#include<memory.h>#include<string.h>using namespace std;int main(){   int n;   cin>>n;   getchar();   while(n--){     string s;     char temp;     getline(cin,s);     int index=1;     temp=s[0];     for(int i=1;i<s.size();i++){        if(temp==s[i])//相同的自增            index++;        else{//出现不同了            if(index==1){                printf("%c",temp);            }else{                printf("%d%c",index,temp);            }            index=1;            temp=s[i];        }     }     if(index==1)        printf("%c\n",temp);    else{        printf("%d%c\n",index,temp);    }   }}