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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/[no content]count-substrings-with-only-one-distinct-letter.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Easy",
"likes": 264,
"likes": 265,
"dislikes": 43,
"isLiked": null,
"similarQuestions": "[]",
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"20.3K\", \"totalSubmission\": \"25.8K\", \"totalAcceptedRaw\": 20344, \"totalSubmissionRaw\": 25817, \"acRate\": \"78.8%\"}",
"stats": "{\"totalAccepted\": \"20.4K\", \"totalSubmission\": \"25.8K\", \"totalAcceptedRaw\": 20361, \"totalSubmissionRaw\": 25843, \"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.",