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.

Note: The sequence of integers will be represented as a string.

class Solution {
public:
    string countAndSay(int n) 
	{
		if (n <= 0) return "";
		int count = 1;
		string res("1");
		while (count < n)
		{
			string tmp;
			char pre = '0';
			int num = 0;
			for (int i = 0; i < res.size(); i++)
			{
				if (res[i] == pre)
					num++;
				else
				{
					if (pre != '0')
					{
						tmp.push_back(num + '0');
						tmp.push_back(pre);
					}
					pre = res[i];
					num = 1;
				}
			}
			tmp.push_back(num + '0');
			tmp.push_back(pre);
			res = tmp;
			count++;
		}
		return res;
    }
};


上一篇:【LeetCode算法-38】Count and Say


下一篇:[HNOI2004]树的计数 BZOJ 1211 prufer序列