count-and-say

最新推荐文章于 2020-01-28 21:56:02 发布

llwjason5555

最新推荐文章于 2020-01-28 21:56:02 发布

阅读量170

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/llwjason5555/article/details/77946490

版权

leetcode 专栏收录该内容

116 篇文章 0 订阅

订阅专栏

题目：

The count-and-say sequence is the sequence of integers beginning as follows:
1, 11, 21, 1211, 111221, …
1is read off as”one 1”or11.
11is read off as”two 1s”or21.
21is read off as”one 2, thenone 1”or1211.
Given an integer n, generate the n th sequence.
Note: The sequence of integers will be represented as a string.

程序：

class Solution {
public:
    string countAndSay(int n) {
        if(n <= 0)
            return "";
        string res = "1";
        for(int i=1;i<n;i++)
        {
            string t = "";
            int count = 1;
            for(int j=1;j<res.length();j++)
            {
                if(res[j] == res[j-1]) 
                    count++;
                else{
                    t.push_back(count+'0');
                    t.push_back(res[j-1]);
                    count = 1;
                }
            }
            t.push_back(count+'0');
            t.push_back(res[res.length()-1]);
            res = t;
        }
        return res;
    }
};