leetcode 38. Count and Say

最新推荐文章于 2022-10-18 17:45:00 发布

延禾xy

最新推荐文章于 2022-10-18 17:45:00 发布

阅读量310

点赞数

分类专栏：数据结构/算法/Leetcode 文章标签： leetcode string

本文链接：https://blog.csdn.net/charles1e/article/details/51753352

版权

数据结构/算法/Leetcode 专栏收录该内容

91 篇文章 0 订阅

订阅专栏

/*
leetcode 38. Count and Say
题目大意：读出每个字符串。譬如说
1 读作 11
11 读作 21
21 读作 1211
...
*/

#include <iostream>
#include <sstream>
#include <string>

using namespace std;

class Solution {
public:
    string countAndSay(int n)
    {
        if (n == 1)
            return "1";
        string ret = "1";
        for (int i = 1; i < n; ++i)
            ret = readString(ret);

        return ret;
    }

    string readString(string str)
    {
        int len = str.size();
        if (len == 1)
            return "1" + str;

        char c;
        int count = 1;      //出现的次数
        string ret="";
        int i = 0;
        while (i < len)
        {
            c = str[i++];
            while (c == str[i] && i < len)
            {
                ++count;    //出现的次数增加1
                ++i;        //判断下一个字符
            }
            //if (i == len)
            ret = ret + char(count + '0') + c;
            count = 1;
        }

        return ret;
    }

};

void test_readString()
{
    Solution sol;
    cout << sol.readString("1") << endl;

}

void test_countAndSay()
{
    Solution sol;
    cout << sol.countAndSay(2) << endl;
    for (int i = 1; i < 10; ++i)
        cout <<  i << ":"<< sol.countAndSay(i) << endl;
}

int main()
{
    //test_readString();
    test_countAndSay();
    return 0;
}