首页 > 代码库 > [Leetcode] Count and Say
[Leetcode] 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.
Solution:
1 public class Solution { 2 public String countAndSay(int n) { 3 StringBuilder s=new StringBuilder("1"); 4 StringBuilder ss=new StringBuilder(); 5 for(int i=1;i<n;++i){ 6 int j=0; 7 int len=s.length(); 8 while(j<len){ 9 int count=1;10 char c=s.charAt(j);11 while(j<len-1&&s.charAt(j)==s.charAt(j+1)){12 j++;13 count++; 14 }15 ss.append(count+"");16 ss.append(c);17 if(j==len-1)18 break;19 j++;20 }21 s=ss;22 ss=new StringBuilder();23 }24 return s.toString();25 }26 }
[Leetcode] Count and Say
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。