[LeetCode]--38. Count and Say

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 nth sequence.

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

这个题目理解起来真是太难了，尤其是英文又不好，只能参看下别人的资料，理解下规则。终于理解，题意是n=1时输出字符串1；n=2时，数上次字符串中的数值个数，因为上次字符串有1个1，所以输出11；n=3时，由于上次字符是11，有2个1，所以输出21；n=4时，由于上次字符串是21，有1个2和1个1，所以输出1211。依次类推，写个countAndSay(n)函数返回字符串。

public String countAndSay(int n) {if (n == 1) {return "1";}// 递归调用，然后对字符串处理String str = countAndSay(n - 1) + "*";// 为了str末尾的标记，方便循环读数char[] c = str.toCharArray();int count = 1;String s = "";for (int i = 0; i < c.length - 1; i++) {if (c[i] == c[i + 1]) {count++;// 计数增加} else {s = s + count + c[i];// 上面的*标记这里方便统一处理count = 1;// 初始化}}return s;}

还有一种非递归的算法。这种我感觉比递归算法写起来就困难一些，理解起来其实差不多，双层循环。

public String countAndSay2(int n) {String oldString = "1";while (--n > 0) {StringBuilder sb = new StringBuilder();char [] oldChars = oldString.toCharArray();for (int i = 0; i < oldChars.length; i++) {int count = 1;while ((i+1) < oldChars.length && oldChars[i] == oldChars[i+1]) {count++;i++;}sb.append(String.valueOf(count) + String.valueOf(oldChars[i]));}oldString = sb.toString();}return oldString;}

[LeetCode]--38. Count and Say相关推荐

LeetCode 38. Count and Say
问题链接 LeetCode 38. Count and Say 题目解析找规律,每一个数字串是上一个数字串的"读法".比如:n=1时为"1",读作" ...
[勇者闯LeetCode] 38. Count and Say
[勇者闯LeetCode] 38. Count and Say Description The count-and-say sequence is the sequence of integers b ...
LeetCode: 38. Count and Say
0509第2题题目 The count-and-say sequence is the sequence of integers with the first five terms as follo ...
51 -leetcode 38 -字符串
// LeetCode 38 字符串 to_string int to string char 直接变为string //边界情况 for int i=0 i<.size() 比较的活 i+1 ...
【Hard 递归动态规划回文串15】LeetCode 730. Count Different Palindromic Subsequences
LeetCode 730. Count Different Palindromic Subsequences 博客转载自:http://zxi.mytechroad.com/blog/dynamic- ...
leetcode python3 简单题38. Count and Say
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第三十八题 (1)题目英文: Given an integer n where 1 ...
Leetcode每日一题:38.Count and Say(外观数列)
看题目着实难懂,评论老哥帮忙找答案,可以这么理解: 题目的意思是对序列前一个数进行报数,数列第一项为1,那第二项就报第一项的有1个1,输出11,然后第三项就在第二项的基础上报数,第二项是11,第三项不 ...
LeetCode 250. Count Univalue Subtrees
原题链接在这里:https://leetcode.com/problems/count-univalue-subtrees/ 题目: Given a binary tree, count the nu ...
LeetCode 204. Count Primes--从一开始的质数个数--Python解法--面试算法题
题目地址:Count Primes - LeetCode Count the number of prime numbers less than a non-negative number, n. E ...

[LeetCode]--38. Count and Say

[LeetCode]--38. Count and Say相关推荐

最新文章

热门文章