题目来源:http://acm.hdu.edu.cn/showproblem.php?pid=1020
Time Limit: 2000/1000 MS
(Java/Others) Memory Limit: 65536/32768 K
(Java/Others)
Total Submission(s):
23937 Accepted Submission(s):
10515
代码如下:
1 #include<iostream> 2 #include<stdio.h> 3 #include<string> 4 #include<string.h> 5 #include<map> 6 #include<math.h> 7 #include<algorithm> 8 #define N 10005 9 using namespace std; 10 char str[N]; 11 int main() 12 { 13 int n,i,t; 14 scanf("%d",&n); 15 while(n--) 16 { 17 scanf("%s",str); 18 i=0; 19 while(str[i]!=‘\0‘) 20 { 21 t=i; 22 while(str[t+1] == str[t]) 23 t++; 24 if(t>i) 25 printf("%d%c",t-i+1,str[t]); 26 else 27 printf("%c",str[t]); 28 i=t+1; 29 } 30 printf("\n"); 31 } 32 return 0 ; 33 }
hdu 1020 简单的字符串处理,布布扣,bubuko.com
原文:http://www.cnblogs.com/zn505119020/p/3582002.html