现在的位置: 首页 > 综合 > 正文

LeetCode–Count and Say

2018年10月01日 ⁄ 综合 ⁄ 共 501字 ⁄ 字号 评论关闭
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) {
        string str;
        string tmp = "1";
        
        for(int i=0; i<n-1; i++)
        {
            str = tmp;
            tmp = "";
            int size = str.size();
            int len = 1;
            
            for(int j=0; j<size; j++)
            {
                if(str[j+1] == str[j])
                    len++;
                else
                {
                    tmp += '0' + len;
                    tmp += str[j];
                    len = 1;
                }
            }
        }
        return tmp;
        
    }
};

抱歉!评论已关闭.