首页 > 其他 > 详细

[LeetCode] Count and Say

时间:2014-08-21 01:32:23      阅读:437      评论:0      收藏:0      [点我收藏+]

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.

class Solution {
public:
    string countAndSay(int n) {
        string result("1");
        string pre(result);
        for(int i=1;i<n;i++){
            int len = pre.size();
            result.clear();
            for(int j=0;j<len;){
                char cur = pre[j];
                int start = j;
                j++;
                while(j<len && cur == pre[j])
                    j++;
                int end = j;
                int num = end - start;
                result += intToS(num);
                result.push_back(pre[start]);

            
            }//end for
           pre = result;
        }//end for
        return result;
    }//end func
private:
    string intToS(int n){
        ostringstream os;
        os<<n;
        string s;
        s = os.str();
        return s;
    }
};

 

[LeetCode] Count and Say,布布扣,bubuko.com

[LeetCode] Count and Say

原文:http://www.cnblogs.com/Xylophone/p/3926005.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!