1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions

View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1095,
"likes": 1096,
"dislikes": 334,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Count Words Obtained After Adding a Letter\", \"titleSlug\": \"count-words-obtained-after-adding-a-letter\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"27.5K\", \"totalSubmission\": \"38.7K\", \"totalAcceptedRaw\": 27517, \"totalSubmissionRaw\": 38694, \"acRate\": \"71.1%\"}",
"stats": "{\"totalAccepted\": \"27.5K\", \"totalSubmission\": \"38.7K\", \"totalAcceptedRaw\": 27524, \"totalSubmissionRaw\": 38705, \"acRate\": \"71.1%\"}",
"hints": [
"Take every substring of s, change a character, and see how many substrings of t match that substring.",
"Use a Trie to store all substrings of t as a dictionary."