【LeetCode】Count and Say

参考链接

http://blog.csdn.net/xshalk/article/details/8183499

http://blog.csdn.net/doc_sgl/article/details/11956229

题目描述

Count and Say

  Total Accepted: 8711  Total Submissions: 32711 My Submissions

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 ret = "1";
		for(int i = 1;i<n;i++)
		{
			ret = countAndSayCore(ret);
		}    
		return ret;
    }
    string countAndSayCore(string in)
    {
    	string ret = "";
    	int count = 1;
		for(int i = 1;i<in.size();i++)
    	{
    		if(in[i-1] != in[i])
			{
				if(count > 10)
					cout<<"error"<<endl;
				ret += char(count+'0');
				ret += char(in[i-1]);
				count = 1;
			}
			else
			{
				count++;
			}	
		}
		ret += char(count+'0');
		ret += in[in.size()-1];
		return ret;
	}
};

推荐学习C++的资料

C++标准函数库

http://download.csdn.net/detail/chinasnowwolf/7108919

在线C++API查询

http://www.cplusplus.com/