38. Count and Say - python3

The count-and-say sequence is a sequence of digit strings defined by the recursive formula:

countAndSay(1) = "1"
countAndSay(n) is the way you would "say" the digit string from countAndSay(n-1), which is then converted into a different digit string.
To determine how you "say" a digit string, split it into the minimal number of groups so that each group is a contiguous section all of the same character. Then for each group, say the number of characters, then say the character. To convert the saying into a digit string, replace the counts with a number and concatenate every saying.

For example, the saying and conversion for digit string "3322251":

Given a positive integer n, return the nth term of the count-and-say sequence.

My Answer 1: (Runtime: 48 ms / Memory Usage: 14.2 MB)

class Solution:
    def countAndSay(self, n: int) -> str:
        if n == 1:
            return "1"
        
        result = "1"
        for i in range(1, n):
            result = self.func(result)
        
        return result
        
    def func(self, s: str) -> str:
        s += '#'
        result = ""
        count = 1
        
        for i in range(1, len(s)):
            if s[i-1] == s[i]:
                count += 1
            else:
                result += str(count) + str(s[i-1])
                count = 1
        
        return result

넘 어려운 문제.,..

싫어요가 두배 이상인거 보니까 나와 같은 동지들이 많은듯~^^

근데 막상 답을 보고나면 이해는 잘된다

countAndSay(1) = 1 이므로 result 값은 1 로 초기화
n만큼 반복문을 돌면서 재귀를 한다...

재귀에선 맨 끝에 #을 넣어줘서 비교하기 더 쉽게 한다는데 이해못함
암튼 여기서도 반복문을 돌면서 같은 숫자면 count++ 로 개수를 셈
다르면 result 에 count 한걸 숫자와 함께 넣어준다