Count and Say

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

原创最新推荐文章于 2024-12-21 10:31:21 发布 · 616 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

46 篇文章

订阅专栏

本文介绍了一种生成计数并说序列的方法，通过模拟读取过程，实现了给定整数n时生成对应的序列。文章提供了C++实现代码示例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目：2

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.

解法：

模拟。。1Y又失败。。

class Solution 
{
public:
	string int_to_string(int t)
	{
		std::stringstream newstr;
		newstr<<t;
		return newstr.str();
	}
    string countAndSay(int n) 
	{
		if(n<=0)	return "";
		string s = "1";
		while(--n)
		{
			string t = "";
			while(s.size()>0)
			{
				int cnt=-1;
				for(int i=0;i<s.size();i++)
				{
					if(s[i]!=s[0])	{cnt=i;break;}
				}
				if(cnt == -1)
				{
					cnt = s.size();
				}
				t=t+int_to_string(cnt)+s[0];
				s=s.substr(cnt,s.size()-cnt);
			}
			s=t;
		}
		return s;
    }
};