直接上代码
func countAndSay(n int) string {
if n == 1 {
return "1"
}
return count(countAndSay(n - 1))
}
func count(s string) string {
c := string(s[0])
count := 1
res := ""
for _, char := range s[1:] {
if string(char) == c {
count += 1
} else {
res = res + strconv.Itoa(count) + string(c)
c = string(char)
count = 1
}
}
res = res + strconv.Itoa(count) + string(c)
return res
}
直接上代码
D139 38. Count and Say 题目链接 38. Count and Say[https://lee...
38. Count and Say
38. Count and Say Description The count-and-say sequence ...
38. Count and Say The count-and-say sequence is the seque...
38. Count and Say The count-and-say sequence is the seque...
LeetCode 38. 报数 链接https://leetcode-cn.com/problems/count-...
题目：38. 外观数列[https://leetcode-cn.com/problems/count-and-sa...
Problem The count-and-say sequence is the sequence of int...
这道题和String Compression同理，但是做了好久；原因是字符串尾部（最后一个字符）的处理。 首先要理...
本文标题：38. Count and Say.go
本文链接：https://www.haomeiwen.com/subject/wablvqtx.html
网友评论