coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +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

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

@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"3.5K\", \"totalSubmission\": \"4.5K\", \"totalAcceptedRaw\": 3506, \"totalSubmissionRaw\": 4532, \"acRate\": \"77.4%\"}",
"stats": "{\"totalAccepted\": \"3.6K\", \"totalSubmission\": \"4.6K\", \"totalAcceptedRaw\": 3604, \"totalSubmissionRaw\": 4640, \"acRate\": \"77.7%\"}",
"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.",