**(leetcode_string) Count and Say

Count and Say

  Total Accepted: 24346  Total Submissions: 94623 My Submissions

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.

Show Tags
Have you met this question in a real interview? 
Yes
 
No

Discuss

c++中string后面拼接int ,用

ostringstream oss;
 oss<<count;
 next+=oss.str();

class Solution {
public:
    string countAndSay(int n) {
        int i, j, count;
        string cur ="1";
        string next = "";
        for(j=1;j<n;j++){
            i=0;
            while(i<cur.length()){
                count = 1;
                while(i+1<cur.length() && cur[i]==cur[i+1]){
                    i++;
                    count++;
                }
                ostringstream oss;
                oss<<count;
                next+=(oss.str()+cur[i]);
                i++;
            }
            cur=next;
            next="";
        }
        return cur;
    }
};


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

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值