[LeetCode]038. 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.


Solution1: 

开始误解了题目的意思,给出了以下的解答,以为给定一串数字,例如(11133225),输出(31232215)。

Eclipse编译测试通过。但无法通过OJ,网上参考别人代码,再回过去看题目,发现是题意理解错误,极其无语!

public class Solution {
    public String countAndSay(int n) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        String num = Integer.toString(n);
        int len = num.length();
        if(len == 0){
            return null;
        }
        if(len == 1){
            return 1+num;
        }
        StringBuffer sb = new StringBuffer();
        int start = 0;
        int next = 1;
        int count = 1;
        while(next<len){
            if(num.charAt(start) == num.charAt(next)){
                next++;
                count++;
            }else{
                sb.append(count);
                sb.append(num.charAt(start));
                count = 1;
                start = next;
                next = start+1;
            }
        }
        sb.append(count);
        sb.append(num.charAt(start));
        return sb.toString();
    }
}



Solution 1: Given an integer n, generate the nth sequence.

stringBuilder 和 stringBuffer区别:

前者速度快,后者是synchronized

public class Solution {
    public String countAndSay(int n) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        if(n==0){
            return "";
        }
        if(n==1){
            return "1";
        }
        String s = countAndSay(n-1);
        StringBuilder sb = new StringBuilder();
        int start = 0;
        int cur = 0;
        while(start<s.length()){
            while(cur<s.length() && s.charAt(start)==s.charAt(cur)){
                cur++;
            }
            sb.append(cur-start);
            sb.append(s.charAt(start));
            start = cur;
            cur++;
        }
        return sb.toString();
    }
}

 


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值