coder-xiaomo/leetcode-problemset
1
0
Fork 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

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/[no content]count-substrings-with-only-one-distinct-letter.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Easy",
"likes": 265,
"dislikes": 43,
"likes": 268,
"dislikes": 44,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "\"aaaba\"\n\"aaaaaaaaaa\"",
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"20.4K\", \"totalSubmission\": \"25.8K\", \"totalAcceptedRaw\": 20361, \"totalSubmissionRaw\": 25843, \"acRate\": \"78.8%\"}",
"stats": "{\"totalAccepted\": \"20.6K\", \"totalSubmission\": \"26.1K\", \"totalAcceptedRaw\": 20589, \"totalSubmissionRaw\": 26131, \"acRate\": \"78.8%\"}",
"hints": [
"What if we divide the string into substrings containing only one distinct character with maximal lengths?",
"Now that you have sub-strings with only one distinct character, Try to come up with a formula that counts the number of its sub-strings.",