[leetcode]38. Count and Say(java)

题目描述：

The count-and-say sequence is the sequence of integers beginning as follows:
1, 11, 21, 1211, 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 sequence.
Note: The sequence of integers will be represented as a string.

代码:

public static String countAndSay(int n) {
        if(n == 1){
            return "1";
            }

        //递归调用，然后对字符串处理
        String str = countAndSay(n-1)+"*";//为了str末尾的标记，方便循环读数
        //System.out.println(str);
        char[] c = str.toCharArray();
        int count = 1;
        String s ="";
        for(int i = 0; i < c.length - 1;i++){
            if(c[i] == c[i+1]){
                count++;//计数增加
                    }else{
                        s = s + count + c[i];//上面的*标记这里方便统一处理
                        count = 1;//初始化
                        }
                }

        return s;
    }   

Hints:

这题在解题思路上主要值得记住的是递归的思想：
首先，递归由于在每次循环都会执行，所以一定要在函数的开头做好递归结束的标志；
其次，在函数中递归式这一行函数通常要放在功能执行的代码的前面，这样才能保证递归过后还会完整执行功能函数
最后，递归自顶向下将原问题分解，达到可以直接求解规模后再一层一层将递归的结果返回给上层递归，最终得到最终答案。