LeetCode Easy Count and Say

最新推荐文章于 2023-05-18 20:05:42 发布

原创最新推荐文章于 2023-05-18 20:05:42 发布 · 210 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

31 篇文章

订阅专栏

本文介绍了一种独特的数列生成方法，即计数与描述序列。通过解析序列的生成规则，文章提供了一个Java实现方案，能够生成指定位置的序列项。此序列从1开始，后续每一项都是对前一项的计数描述。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

Solution1

public class Solution1 {
    public String countAndSay(int n) {
        String before = "1";
        StringBuilder sb = new StringBuilder(before);
        char count, num;
        for (int i = 1; i < n; i++) {
            sb = new StringBuilder();
            int j = 0;
            while (j < before.length()) {
                num = before.charAt(j++);
                count = 1;
                while (j < before.length() && num == before.charAt(j)) {
                    j++;
                    count++;
                }
                count += '0';
                sb.append(count);
                sb.append(num);
            }
            before = sb.toString();
        }
        return sb.toString();
    }
}