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

[LeetCode] Count and Say

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

标签:style   blog   color   os   io   for   ar   art   

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

标签:style   blog   color   os   io   for   ar   art   

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

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