38. Count and Say
https://leetcode.com/problems/count-and-say Count and Say - LeetCodeCan you solve this real interview question? Count and Say - The count-and-say sequence is a sequence of digit strings defined by the recursive formula: * countAndSay(1) = "1" * countAndSay(n) is the run-length encoding of countAndSay(n - 1). Run-length encleetcode.com 이 문제는 한국에서는 베르나르 베르베르의 소설 '개미'에 등장하여 흔히 **"개미 수열"**이라고도 불리는 C..
Developer/LEETCODE
2026. 2. 11. 21:27
