Problem B

Problem 13 » Problem B 查看标程

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

3
ABC
ABBCCC
ACB

SAMPLE OUTPUT

ABC
A2B3C
ACB

我的代码（有点复杂了）：

#include<iostream>
using namespace std;
int main()
{
    char s[10001];
 int i,t,num;
 cin>>t;
 while(t--)
 {
  cin>>s;
   int len=strlen(s);
   num=1;
   char l=s[0];
   for(i=1;i<len;i++)
   {
  if(l==s[i])
      num++;
  else
  {
    if(num==1)
     cout<<l;
    else
    {
     cout<<num<<l;
        num=1;
      
    }
   
  }
        l=s[i];
   }
   if(num==1)
   cout<<l;
   else
  cout<<num<<l;
  
   cout<<endl;
 }
}

 

系统标程：

#include<iostream>
using namespace std;
#include<cstring>
int main()
{
 int n,len,j,m=1;
 cin>>n;
 char s[10001];
 while（n--）

 {
  cin>>s;
  len=strlen(s);
  for(j=0;j<len;j++)
  {
   if(s[j]!=s[j+1])
   {
    if(m>1)
     cout<<m;
    cout<<s[j];
    m=1;
   }
   if(s[j]==s[j+1])
    m++;
  }
  cout<<endl;
 }
 return 0;
}