coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/count-sorted-vowel-strings.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1720,
"dislikes": 37,
"likes": 1772,
"dislikes": 38,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "1\n2\n33",
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"81.4K\", \"totalSubmission\": \"108.8K\", \"totalAcceptedRaw\": 81446, \"totalSubmissionRaw\": 108843, \"acRate\": \"74.8%\"}",
"stats": "{\"totalAccepted\": \"83.2K\", \"totalSubmission\": \"111K\", \"totalAcceptedRaw\": 83152, \"totalSubmissionRaw\": 111044, \"acRate\": \"74.9%\"}",
"hints": [
"For each character, its possible values will depend on the value of its previous character, because it needs to be not smaller than it.",
"Think backtracking. Build a recursive function count(n, last_character) that counts the number of valid strings of length n and whose first characters are not less than last_character.",