1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
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

View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 346,
"dislikes": 106,
"likes": 370,
"dislikes": 111,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Number of Matching Subsequences\", \"titleSlug\": \"number-of-matching-subsequences\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Subarrays with K Different Integers\", \"titleSlug\": \"subarrays-with-k-different-integers\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Number of Substrings With Only 1s\", \"titleSlug\": \"number-of-substrings-with-only-1s\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Longest Substring Of All Vowels in Order\", \"titleSlug\": \"longest-substring-of-all-vowels-in-order\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "\"aeiouu\"\n\"unicornarihan\"\n\"cuaieuouac\"",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"15.7K\", \"totalSubmission\": \"24K\", \"totalAcceptedRaw\": 15739, \"totalSubmissionRaw\": 23951, \"acRate\": \"65.7%\"}",
"stats": "{\"totalAccepted\": \"16.5K\", \"totalSubmission\": \"25.1K\", \"totalAcceptedRaw\": 16493, \"totalSubmissionRaw\": 25066, \"acRate\": \"65.8%\"}",
"hints": [
"While generating substrings starting at any index, do you need to continue generating larger substrings if you encounter a consonant?",
"Can you store the count of characters to avoid generating substrings altogether?"