LeetCode ! 38. Count and Say

最新推荐文章于 2024-07-11 23:32:17 发布

萝卜丝皮尔

最新推荐文章于 2024-07-11 23:32:17 发布

阅读量25

点赞数

分类专栏：数据结构与算法文章标签： leetcode 算法

本文链接：https://blog.csdn.net/qq_43448491/article/details/131121626

版权

数据结构与算法专栏收录该内容

106 篇文章 0 订阅

订阅专栏

38. Count and Say
The count-and-say sequence is a sequence of digit strings defined by the recursive formula:

countAndSay(1) = "1"
countAndSay(n) is the way you would "say" the digit string from countAndSay(n-1), which is then converted into a different digit string.
To determine how you "say" a digit string, split it into the minimal number of substrings such that each substring contains exactly one unique digit. Then for each substring, say the number of digits, then say the digit. Finally, concatenate every said digit.

For example, the saying and conversion for digit string "3322251":


Given a positive integer n, return the nth term of the count-and-say sequence.

 

Example 1:

Input: n = 1
Output: "1"
Explanation: This is the base case.
Example 2:

Input: n = 4
Output: "1211"
Explanation:
countAndSay(1) = "1"
countAndSay(2) = say "1" = one 1 = "11"
countAndSay(3) = say "11" = two 1's = "21"
countAndSay(4) = say "21" = one 2 + one 1 = "12" + "11" = "1211"

思路：我觉得这道题主要是简单模拟，考代码实现能力。用递归实现会简单点。
要注意的是最后一种字符要手动加入到StringBuilder中。
下面是这种思路的两种实现方式

class Solution {
    public String countAndSay1(int n){
		if(n<1)
		{
			return "";
		}
		
		if(n==1)
		{
			return "1";
		}
		
		StringBuilder builder = new StringBuilder();
		char[] str = countAndSay(n-1).toCharArray();
		int time=1;// counter
		for(int i=1;i<str.length;i++)
		{
			if(str[i-1]==str[i])
			{
				time++;
			}
			else//出现新字符，结算上一种字符
			{
				builder.append(String.valueOf(time));
				builder.append(String.valueOf(str[i-1]));
				time=1;
			}
			
		}
		// 不要忘记，手动结算最后一种字符
		builder.append(String.valueOf(time));
		builder.append(String.valueOf(str[str.length-1]));
		return builder.toString();
	}

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

        String temp = "1";
        StringBuilder step = new StringBuilder();

        while(n-1!=0){
            char[] chs = temp.toCharArray();
            char ch = chs[0];
            int count=1;
            step.delete(0,step.length());//step.setLength(0);

            for(int i=1;i<chs.length;i++){
                if(ch!=chs[i]){
                    step.append(count);//str(count)+str(ch)
                    step.append(ch);
                    count=1;
                    ch=chs[i];
                }else{
                    count++;
                }
            }// end for
            step.append(count);
            step.append(ch);
            temp = new String(step.toString());
            n--;
        }// end while

        return temp;
    }
}