Description
The look and say sequence is defined as follows. Start with any string of digits as the first element in the sequence. Each subsequent element is defined from the previous one by "verbally" describing the previous element. For example, the string 122344111 can be described as "one 1, two 2's, one 3, two 4's, three 1's". Therefore, the element that comes after 122344111 in the sequence is 1122132431. Similarly, the string 101 comes after 1111111111. Notice that it is generally not possible to uniquely identify the previous element of a particular element. For example, a string of 112213243 1's also yields 1122132431 as the next element.
Input
The input consists of a number of cases. The first line gives the number of cases to follow. Each case consists of a line of up to 1000 digits.
Output
For each test case, print the string that follows the given string.
Sample Input
3
122344111
1111111111
12345
Sample Output
1122132431
101
1112131415
这道题的意思是比如输入1122333111就输出21223331意思是2个1,2个2,3个3,3个1。
思路很简单,定义一个字符串数组存这些数字,进行循环,当a[i+1]=a[i]时,计数器加一,可以设计数器初值为1,也可以设为0输出时加1。代码如下:
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a[100],i,n,j,num=1;
char l[1000];
cin>>n;
for(i=0;i<n;i++)
{
cin>>l;
for(j=0;j<strlen(l);j++)
{
if(l[j+1]==l[j])
num++;
else
{
cout<<num<<l[j];
num=1;
}
}
cout<<endl;
}
}