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

【LeetCode】Count and Say

时间:2014-12-16 18:42:26      阅读:123      评论:0      收藏:0      [点我收藏+]

标签:style   blog   http   ar   io   color   sp   strong   on   

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.

 

思路:对于下一个字符串= 对于当前字符串:∑(字符个数+字符)

例如1211,下一个字符串就是count(1)+‘1‘+count(2)+‘2‘+count(1)+‘1‘=111221

class Solution {
public:
    string countAndSay(int n) {
        if(n == 0)
            return "";
        else
        {
            string last = "1";
            string next = "";
            n--;
            while(n--)
            {
                next = "";
                int i = 0;
                char cur = last[i];
                int count = 0;
                while(i < last.size())
                {
                    count = 0;
                    cur = last[i];
                    while(i < last.size() && last[i] == cur)
                    {
                        count ++;
                        i ++;
                    }
                    char temp[32];
                    sprintf(temp, "%d", count);
                    string countStr = temp;
                    next += countStr;
                    next += cur;
                }
                last = next;
            }
            return last;
        }
    }
};

bubuko.com,布布扣

【LeetCode】Count and Say

标签:style   blog   http   ar   io   color   sp   strong   on   

原文地址:http://www.cnblogs.com/ganganloveu/p/4167591.html

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