(解题报告)HDU1020---Encoding

Encoding

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

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

这个题有一个挺坑的误区，不是统计字符串中出现的所有字符的个数，而是统计相邻的个数！

strlen()表示字符数组的长度。

使用num进行计数。

#include <stdio.h>
#include <string.h>
int main(){
    int n,i,num;
    char str[];
    scanf("%d",&n);
    while(n--){
        num=;
        scanf("%s",str);
      for(i=;i<strlen(str);i++){
          if(str[i]==str[i+]){ //如果一个字符跟它后面的字符相同则num++;
                          num++;
          }
          else{
              if(num<=) {
                     printf("%c",str[i]);
                     num=;
                     }//记住num要重置为1。
              else{
                       printf("%d%c",num,str[i]);
                       num=; 
                  }
          }
      }printf("\n");
    }return ;
}