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 <cstdio>
#include <cstdlib>
#include <cstring>
#include <cstdlib>
#include <cstring>
const int maxn = 10001;
using namespace std;
int main()
{
int n;
scanf("%d",&n);
getchar();
while(n--)
{
char x;
int m,i,j,k=1;
int b[26];
memset(b,0,sizeof(b));
char a[maxn];
gets(a);
m=strlen(a);
for(i=0; i<m; i++)
{
x=a[i];
for(j=i+1; j<m; j++)
{
if(a[j]==a[i])
{
k++;
}
else
break;
}
i+=k-1;
if(k==1)
{
printf("%c",x);
k=1;
}
if(k>1)
{
printf("%d",k);
printf("%c",x);
k=1;
}
}
/*for(i=0; i<26; i++)
{
if(b[i]==0)
continue;
else if(b[i]==1)
printf("%c",i+65);
else
{
printf("%d",b[i]);
printf("%c",i+65);
}
}*/
printf("\n");
}
return 0;
}
在输入ASSDS时输出应该是A2SDS而不是A3SD,程序要求你对连续的相同的字符进行计数,而不是对全部的进行计数。刚开始我开了两个数组,一个用来存储字符串,另一个开了26个,用来记数,但是这种方法只能用来对于串中不连续出现的也一起计数。后来经过改进。得出以上代码,
但是我的这种方法最要注意的是,先找一样的,然后++,但是循环时要把一样的给跳过去,于是就有了k+=i;