美文网首页
38. Count and Say

38. Count and Say

作者: i_Eloise | 来源:发表于2018-01-22 14:36 被阅读0次

    Question
    The count-and-say sequence is the sequence of integers with the first five terms as following:

    1 1
    2 11
    3 21
    4 1211
    5 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 term of the count-and-say sequence.

    Note: Each term of the sequence of integers will be represented as a string.

    • frist attempt
    class Solution {
    public:
        string countAndSay(int n) {
            string read="1";
            string temp="";
            for(int i = 2 ; i <= n ; i++)
            {
                for(int j = 0;j < read.size();)
                {
                    int count=1;
                    while(read[j+count]==read[j] && j <read.size())
                        count++;
                    temp += to_string(count);
                    temp+=read[j];
                    j+=count;
                }
                read=temp;
                temp="";
            }
            return read;
        }
    };
    

    相关文章

      网友评论

          本文标题:38. Count and Say

          本文链接:https://www.haomeiwen.com/subject/ruvlaxtx.html