【LeetCode算法练习（C++）】Count and Say

最新推荐文章于 2020-11-13 15:58:07 发布

Stella-Song

最新推荐文章于 2020-11-13 15:58:07 发布

阅读量267

点赞数

分类专栏：算法分析文章标签： leetcode c++

本文链接：https://blog.csdn.net/sst2230879/article/details/78769369

版权

算法分析专栏收录该内容

42 篇文章 0 订阅

订阅专栏

题目：
The count-and-say sequence is the sequence of integers with the first five terms as following:
1. 1
2. 11
3. 21
4. 1211
5. 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 term of the count-and-say sequence.
Note: Each term of the sequence of integers will be represented as a string.

Example 1:
Input: 1
Output: “1”

Example 2:
Input: 4
Output: “1211”

链接：Count and Say

解法：按阅读逻辑重复n次。时间O(n^2)

class Solution {
public:
    string countAndSay(int n) {
        string ori = "1", ans = "1";
        for (int i = 0; i < n - 1; i++) {
            int len = ori.length(), pos = 0;
            ans.clear();
            while (pos < len) {
                int cnt = 0;
                while (pos + cnt < len && ori[pos + cnt] == ori[pos]) cnt++;
                ans.push_back(cnt + '0');
                ans.push_back(ori[pos]);
                pos = pos + cnt;
            }
            ori = ans;
        }
        return ans;
    }
};