HDU 1020 Encoding 控制字符串的输出

Encoding

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

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
  
  

/*
简单题 控制字符串的输出 
*/

#include<iostream>
#include<cstring>
using namespace std;

char str[10001];
int main(){
    
    int n,i,len,k;
    cin>>n;
    while(n--)
    {
        scanf("%s",str);
        len=strlen(str);
        k=1;
        for(i=0;i<len-1;i++)
        {
            if(str[i+1]==str[i])  k++;
                else {
                    if(k!=1)
                        printf("%d%c",k,str[i]);
                    else 
                        printf("%c",str[i]);
                    k=1;
                }
        }
        //最后个字符没有输出 
        if(k!=1)
            printf("%d%c",k,str[len-1]);
        else 
            printf("%c",str[len-1]);
        printf("\n");
    }
    return 0;
}