coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +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/can-convert-string-in-k-moves.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 273,
"dislikes": 226,
"likes": 277,
"dislikes": 228,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "\"input\"\n\"ouput\"\n9\n\"abc\"\n\"bcd\"\n10\n\"aab\"\n\"bbb\"\n27",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"13.3K\", \"totalSubmission\": \"40.9K\", \"totalAcceptedRaw\": 13276, \"totalSubmissionRaw\": 40935, \"acRate\": \"32.4%\"}",
"stats": "{\"totalAccepted\": \"13.4K\", \"totalSubmission\": \"41.3K\", \"totalAcceptedRaw\": 13406, \"totalSubmissionRaw\": 41295, \"acRate\": \"32.5%\"}",
"hints": [
"Observe that shifting a letter x times has the same effect of shifting the letter x + 26 times.",
"You need to check whether k is large enough to cover all shifts with the same remainder after modulo 26."