Count and Say

生成的博客标题：解读计数与说法序列算法实现

最新推荐文章于 2024-12-21 10:31:21 发布

brucehb

最新推荐文章于 2024-12-21 10:31:21 发布

阅读量362

点赞数

CC 4.0 BY-SA版权

分类专栏：算法

本文链接：https://blog.youkuaiyun.com/brucehb/article/details/45117773

算法专栏收录该内容

636 篇文章

订阅专栏

本文详细介绍了如何实现计数与说法序列算法，并通过实例展示了其核心逻辑和步骤，旨在帮助读者理解并掌握该算法的应用。

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";
	    n--;
	    while (n > 0)
	    {
		    string temp = result;
		    result.erase(0, result.length());
		    char curValue = temp[0];
		    int count = 1;
		    for (int i = 1; i < temp.length(); i++)
		    {
			    if (temp[i] == curValue)
			    {
				    count++;
			    }
			    else
			    {
				    result.append(1, (char)(count+'0'));
				    result.append(1, curValue);
				    count = 1;
				    curValue = temp[i];
			    }
		    }
		
		    result.append(1, (char)(count+'0'));
		    result.append(1, curValue);
		    n--;
	    }

	    return result; 
    }
};