码迷,mamicode.com
首页 > 其他好文 > 详细

[leetcode]Count and Say

时间:2015-01-24 06:42:45      阅读:169      评论:0      收藏:0      [点我收藏+]

标签:

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.

public:
    string countAndSay(int n) {
        string start = intToString(1);
		string tmp = "";
		int i,j;
		char cur = start[0];
		int count = 0;
		for(i = 1; i < n; i++)
		{
			for(j = 0; j < start.length(); j++)
			{
				if(start[j] == cur)
				{
					count++;
				}else{
					tmp = tmp+intToString(count)+cur;
					cur = start[j];
					count = 1;
				}
			}
			tmp = tmp+intToString(count)+cur;
			start = tmp;
			count = 0;
			tmp = "";
			cur = start[0];
		}
		return start;
    }
	string intToString(int in)
	{
		return to_string(in);
	}

  

[leetcode]Count and Say

标签:

原文地址:http://www.cnblogs.com/zhutianpeng/p/4245344.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!