LeetCode Count and Say

题意

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.

解法

第一次用递归来写，虽然过了但是太不简洁优雅，后来换成了非递归的方式。

class Solution
{
class Solution
{
public:
	string countAndSay(int n)
	{
		string	cur = "1";

		while(-- n)
		{
			int	count = 1;
			int	i = 0;
			string	temp;
			temp.clear();

			while(i < cur.size())
			{
				while(i + 1 < cur.size() && (cur[i] == cur[i + 1]))
				{
					i ++;
					count ++;
				}
				temp += to_string(count);
				temp += to_string(cur[i] - '0');

				count = 1;
				i ++;
			}
			cur = temp;
		}
		return	cur;
	}
};