首页 > 代码库 > 38. Count and Say

38. Count and Say

2024-10-06 05:11:01   219人阅读

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.

Example 1:

Input: 1
Output: "1"

Example 2:

Input: 4
Output: "1211"











class Solution {
public:
    string countAndSay(int n) {
        string result;
        
        result.push_back(‘1‘);
        for (int i = 2; i <= n; ++i) {
            string tmp(result);
            result.clear();
            
            int size = tmp.size();
            for (int index = 0; index <= size-1; ++index) {
                int count = 1;
                while (index <= size-2 && tmp[index] == tmp[index + 1]) {
                    ++index;
                    ++count;
                }
                result += std::to_string(count);
                result.push_back(tmp[index]);
            }
        }
        return result;
    }
};




 
38. Count and Say






























        

            
                
                  
                
                

                    联系

                    我们