mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-02 22:13:28 +08:00
update
This commit is contained in:
@@ -143,7 +143,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"5.3K\", \"totalSubmission\": \"16.5K\", \"totalAcceptedRaw\": 5296, \"totalSubmissionRaw\": 16520, \"acRate\": \"32.1%\"}",
|
||||
"stats": "{\"totalAccepted\": \"5.3K\", \"totalSubmission\": \"16.5K\", \"totalAcceptedRaw\": 5301, \"totalSubmissionRaw\": 16532, \"acRate\": \"32.1%\"}",
|
||||
"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."
|
||||
|
Reference in New Issue
Block a user