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/maximum-number-of-non-overlapping-substrings.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 458,
"dislikes": 55,
"likes": 466,
"dislikes": 56,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "\"adefaddaccc\"\n\"abbaccd\"",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"10.6K\", \"totalSubmission\": \"28.3K\", \"totalAcceptedRaw\": 10582, \"totalSubmissionRaw\": 28295, \"acRate\": \"37.4%\"}",
"stats": "{\"totalAccepted\": \"10.7K\", \"totalSubmission\": \"28.7K\", \"totalAcceptedRaw\": 10740, \"totalSubmissionRaw\": 28664, \"acRate\": \"37.5%\"}",
"hints": [
"Notice that it's impossible for any two valid substrings to overlap unless one is inside another.",
"We can start by finding the starting and ending index for each character.",