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

6
leetcode/originData/replace-all-s-to-avoid-consecutive-repeating-characters.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 377,
"dislikes": 143,
"likes": 382,
"dislikes": 144,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "\"?zs\"\n\"ubv?w\"",
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"43.2K\", \"totalSubmission\": \"86.6K\", \"totalAcceptedRaw\": 43193, \"totalSubmissionRaw\": 86560, \"acRate\": \"49.9%\"}",
"stats": "{\"totalAccepted\": \"43.8K\", \"totalSubmission\": \"88K\", \"totalAcceptedRaw\": 43803, \"totalSubmissionRaw\": 87997, \"acRate\": \"49.8%\"}",
"hints": [
"Processing string from left to right, whenever you get a ‘?’, check left character and right character, and select a character not equal to either of them",
"Do take care to compare with replaced occurrence of ‘?’ when checking the left character."