coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-22 05:26:46 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/count-and-say.json
View File

@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"272.1K\", \"totalSubmission\": \"454.5K\", \"totalAcceptedRaw\": 272054, \"totalSubmissionRaw\": 454493, \"acRate\": \"59.9%\"}",
"stats": "{\"totalAccepted\": \"272.5K\", \"totalSubmission\": \"455.2K\", \"totalAcceptedRaw\": 272486, \"totalSubmissionRaw\": 455193, \"acRate\": \"59.9%\"}",
"hints": [
"The following are the terms from n=1 to n=10 of the count-and-say sequence:\r\n<pre>\r\n 1. 1\r\n 2. 11\r\n 3. 21\r\n 4. 1211\r\n 5. 111221 \r\n 6. 312211\r\n 7. 13112221\r\n 8. 1113213211\r\n 9. 31131211131221\r\n10. 13211311123113112211\r\n</pre>",
"To generate the <i>n</i><sup>th</sup> term, just <i>count and say</i> the <i>n</i>-1<sup>th</sup> term."