poj3438 Look and Say

/*poj3438 Look and Say
题目要求将数n按一定规则进行转换，比如：1231560，
这个数字中有1个0、2个1、1个2、1个3、1个5、1个6，则，
其转换后的下一个数字为102112131516。
思路，存到string里，边循环边比较边输出
*/

#include<iostream>
#include<string>
using namespace std;
int a[10];

int main()
{
    string str;
    int m;
    cin >> m;
    while (m--)
    {
        cin >> str;
        int len = str.length();
        int num = 1;
        char ch = str[0];
        int i;
        for (i = 1; i < len; ++i)
        {
            if (str[i] == ch)
                num++;
            else
            {
                cout << num << str[i -1] - '0'; //不同，输出上一个
                ch = str[i];  //再次初始化
                num = 1;
            }
        }
        cout << num << str[i - 1] - '0' << endl; //最后跳出了没有输出
    }
    return 0;
}

/*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*/

Description

名词

描述, 描写, 色