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-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

6
leetcode/originData/replace-the-substring-for-balanced-string.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 729,
"dislikes": 151,
"likes": 730,
"dislikes": 152,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "\"QWER\"\n\"QQWE\"\n\"QQQW\"",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"22.1K\", \"totalSubmission\": \"61.2K\", \"totalAcceptedRaw\": 22129, \"totalSubmissionRaw\": 61248, \"acRate\": \"36.1%\"}",
"stats": "{\"totalAccepted\": \"22.2K\", \"totalSubmission\": \"61.3K\", \"totalAcceptedRaw\": 22162, \"totalSubmissionRaw\": 61326, \"acRate\": \"36.1%\"}",
"hints": [
"Use 2-pointers algorithm to make sure all amount of characters outside the 2 pointers are smaller or equal to n/4.",
"That means you need to count the amount of each letter and make sure the amount is enough."