码迷,mamicode.com
首页 > 其他好文 > 详细

[Leetcode] Count and Say

时间:2014-10-19 05:50:58      阅读:147      评论:0      收藏:0      [点我收藏+]

标签:style   blog   color   io   os   ar   for   sp   div   

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

标签:style   blog   color   io   os   ar   for   sp   div   

原文地址:http://www.cnblogs.com/Phoebe815/p/4034179.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!