LeetCode-38. 报数

38. 报数

The count-and-say sequence is the sequence of integers with the first five terms as following:

1.     1
2.     11
3.     21
4.     1211
5.     111221

1 is read off as “one 1” or 11.
11 is read off as “two 1s” or 21.
21 is read off as “one 2, then one 1” or 1211.

Given an integer n where 1 ≤ n ≤ 30, generate the nth term of the count-and-say sequence.

Note: Each term of the sequence of integers will be represented as a string.

Example 1:

Input: 1
Output: "1"

Example 2:

Input: 4
Output: "1211"

思路

这道题明显是一种递推问题，想知道第n个字符串，必须要知道第n-1个字符串，，，，依次下去，这就成一个递归了，所以可以用递归来解决。这道题读一读应该不难理解，通过上一个字符串，读出来就是下一个字符串，关键是怎么将每种数字的个数和该数字组合到一起加到字符串中，这就需要两个位置变量i,j，i用来标记某一位上的数字，j从i+1开始往后走，判断相同的数字，当不同时，i，j之差便是与i相同的个数，然后依次加到字符串中。

class Solution {
public:
    string countAndSay(int n) {
        if(n == 1) return"1";
        else
        {
            string s = countAndSay(n-1);
            string s1 = "";
            int i,j;
            for(i=0,j=1;j<=s.length();j++)
            {
                if(j==s.size() || s[i] != s[j])
                {
                    s1 += j-i+'0';
                    s1 += s[i];
                    i = j;
                }
            }
            return s1;
        }
    }
};