0038_Count and Say

最新推荐文章于 2018-01-16 20:46:14 发布

wsy2846513

最新推荐文章于 2018-01-16 20:46:14 发布

阅读量176

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/wsy2846513/article/details/76408520

版权

LeetCode 专栏收录该内容

40 篇文章 0 订阅

订阅专栏

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

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 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”

JAVA

方法一

直接使用循环来做，注意控制好循环次数以及每次count的初始值即可。时间效率在1/2左右。

public class Solution {
    public String countAndSay(int n) {
        if (n < 1) {
            return "";
        }
        String s = "1";
        StringBuffer temp;
        int count;
        for (int i = 1; i < n; i++) {
            temp = new StringBuffer();
            count = 1;
            for (int j = 1; j < s.length(); ++j) {
                if (s.charAt(j - 1) == s.charAt(j)) {
                    ++count;
                } else {
                    temp.append(count);
                    temp.append(s.charAt(j - 1));
                    count = 1;
                }
            }
            temp.append(count);
            temp.append(s.charAt(s.length() - 1));
            s = temp.toString();
        }
        return s;
    }
}