[LeetCode]Count and Say

最新推荐文章于 2020-04-03 01:01:57 发布

原创最新推荐文章于 2020-04-03 01:01:57 发布 · 542 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Java #LeetCode

LeetCode 专栏收录该内容

160 篇文章

订阅专栏

本文详细解析了计数与说序列的生成原理，通过递归方法实现序列的构建过程，深入理解每一步如何从上一个序列中生成下一个序列。

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

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 n^th sequence.

Note: The sequence of integers will be represented as a string.

public class Solution {
    public String countAndSay(int n) {
        if(n==1) return "1";
        String s = countAndSay(n-1);
        StringBuilder sb = new StringBuilder();
        for(int i=0;i<s.length();i++){
        	char c = s.charAt(i);
        	int k = 0;
        	for(int j=i+1;j<s.length();j++){
        		if(c==s.charAt(j)){
        			k++;
        		}else{
        			break;
        		}
        	}
        	i=i+k;
        	if(k==0){
        		sb.append("1"+Character.toString(c));
        	}
        	else{
        		sb.append(Integer.toString(k+1)+Character.toString(c));
        	}
        }
        return sb.toString();
    }
}