LeetCode第38题：Count and Say（Java详解）

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 where 1 ≤ n ≤ 30, generate the nth term of the count-and-say sequence. You can do so recursively, in other words from the previous member read off the digits, counting the number of digits in groups of the same digit.

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

Example 1:

Input: 1
Output: “1”
Explanation: This is the base case.
Example 2:

Input: 4
Output: “1211”
Explanation: For n = 3 the term was “21” in which we have two groups “2” and “1”, “2” can be read as “12” which means frequency = 1 and value = 2, the same way “1” is read as “11”, so the answer is the concatenation of “12” and “11” which is “1211”.

解析：
看到题目，类似于数值累加的概念，如递归求fabonacci数列，大家有木有同感，也是提供数值，然后给定规律，你去计算；此题规律给定如下：
1
11
21
1211
111221
以此类推
本题思路很清晰啦，就是递归求值，本题字符，那就字符相加；下面方法解题很巧妙。

Java代码：

class Solution {
    public String countAndSay(int n) {
        if(n <= 0)
        {
            return "";
        }
        String result = "1";
        while(--n > 0)
        {
            String temp = "";
            for(int i = 0;i < result.length();i++)
            {
                int cur = 1;
                while(result.length() > (i + 1) && result.charAt(i) == result.charAt(i+1))
                    //对于前一个数，找出相同元素的个数，把个数和该元素存到新的string里
                {
                    ++ cur;
                    ++ i;
                }
                temp += Integer.toString(cur) + result.charAt(i); 
            }
            result = temp;
        }
        return result;
    }
}

性能：

性能对比：

总结：同样思路用JS，速度咋这么慢呢？语言间真是博大精深，各有优势吧，以后在研究，共勉！