Leetcode Num.38 -- Count and Say

题目描述：

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, 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行决定，很容易让人想到递归或者动态规划的解法。

边界条件是N==1时返回”1”。
循环逻辑是对N-1行进行进行计数。

此处仅展示递归解法的代码。

递归解法Code：

class Solution {
    public String countAndSay(int n) {
        if (n == 1) {
            return "1";
        }
        String pre = countAndSay(n-1);
        int count = 1;
        StringBuilder res  = new StringBuilder();
        char[] arr = pre.toCharArray();
        for (int i = 0; i < arr.length -1; i++ ){
            if (arr[i] == arr[i+1]) {
                count++;
            } else {
                res.append(count).append(arr[i]);
                count = 1;
            }
        }
        res.append(count).append(arr[arr.length-1]);
        return res.toString();
    }
}