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/change-minimum-characters-to-satisfy-one-of-three-conditions.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 229,
"dislikes": 253,
"likes": 235,
"dislikes": 258,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "\"aba\"\n\"caa\"\n\"dabadd\"\n\"cda\"",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"9K\", \"totalSubmission\": \"26.7K\", \"totalAcceptedRaw\": 9030, \"totalSubmissionRaw\": 26652, \"acRate\": \"33.9%\"}",
"stats": "{\"totalAccepted\": \"9.3K\", \"totalSubmission\": \"27.2K\", \"totalAcceptedRaw\": 9314, \"totalSubmissionRaw\": 27205, \"acRate\": \"34.2%\"}",
"hints": [
"Iterate on each letter in the alphabet, and check the smallest number of operations needed to make it one of the following: the largest letter in a and smaller than the smallest one in b, vice versa, or let a and b consist only of this letter.",
"For the first 2 conditions, take care that you can only change characters to lowercase letters, so you can't make 'z' the smallest letter in one of the strings or 'a' the largest letter in one of them."