coder-xiaomo/leetcode-problemset
1
0
Fork 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

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/remove-all-occurrences-of-a-substring.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 544,
"likes": 545,
"dislikes": 30,
"isLiked": null,
"similarQuestions": "[]",
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"25K\", \"totalSubmission\": \"34.7K\", \"totalAcceptedRaw\": 24954, \"totalSubmissionRaw\": 34703, \"acRate\": \"71.9%\"}",
"stats": "{\"totalAccepted\": \"25.1K\", \"totalSubmission\": \"34.8K\", \"totalAcceptedRaw\": 25061, \"totalSubmissionRaw\": 34843, \"acRate\": \"71.9%\"}",
"hints": [
"Note that a new occurrence of pattern can appear if you remove an old one, For example, s = \"ababcc\" and pattern = \"abc\".",
"You can maintain a stack of characters and if the last character of the pattern size in the stack match the pattern remove them"