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

4
leetcode-cn/originData/[no content]count-pairs-of-equal-substrings-with-minimum-difference.json
View File

@@ -12,7 +12,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 1,
"likes": 2,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"256\", \"totalSubmission\": \"473\", \"totalAcceptedRaw\": 256, \"totalSubmissionRaw\": 473, \"acRate\": \"54.1%\"}",
"stats": "{\"totalAccepted\": \"264\", \"totalSubmission\": \"488\", \"totalAcceptedRaw\": 264, \"totalSubmissionRaw\": 488, \"acRate\": \"54.1%\"}",
"hints": [
"If the chosen substrings are of size larger than 1, then you can remove all but the first character from both substrings, and you'll get equal substrings of size 1, with the same a but less j. Hence, it's always optimal to choose substrings of size 1.",
"If you choose a specific letter, then it's optimal to choose its first occurrence in firstString, and its last occurrence in secondString, to minimize j-a."