【LeetCode】38. Count and Say Python3解法

最新推荐文章于 2024-09-17 23:15:58 发布

铭铭铭铭铭铭铭铭

最新推荐文章于 2024-09-17 23:15:58 发布

阅读量121

点赞数

文章标签： python leetcode

本文链接：https://blog.csdn.net/weixin_44540204/article/details/105282582

版权

题目描述：

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

```
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 where 1 ≤ n ≤ 30, generate the nth term of the count-and-say sequence. You can do so recursively, in other words from the previous member read off the digits, counting the number of digits in groups of the same digit.

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

例子：

Example 1:

Input: 1
Output: "1"
Explanation: This is the base case.

Example 2:

Input: 4
Output: "1211"
Explanation: For n = 3 the term was "21" in which we have two groups "2" and "1", "2" can be read as "12" which means frequency = 1 and value = 2, the same way "1" is read as "11", so the answer is the concatenation of "12" and "11" which is "1211".

思路：

首先写一个可以读取一次的函数，再写一个循环n次的主函数即可。关键在于读取一次的函数，首先要定义一个count来数每个数的个数，num来记录读取的数字。当遇到新的数字的时候，将count和num连接起来存到字符串中，并且更新count等于1，num更新新的数字。最后将新的string输出。

代码：

class Solution:
    def countAndSay(self, n: int) -> str:
        if n == 1: return "1"
        string = "1"
        level = 1
        while level < n:
            string = self.oneTime(string)
            level += 1
        return string

    def oneTime(self,string):
        res = ""

        count = 0
        num = int(string[0])
        for i in string:
            if int(i) != num and count != 0:
                res += (str(count) + str(num))
                count = 1
                num = int(i)
            else:
                count += 1
        res += (str(count) + str(num))
        return res