mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-06 16:01:41 +08:00
update
This commit is contained in:
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"17.8K\", \"totalSubmission\": \"51.8K\", \"totalAcceptedRaw\": 17793, \"totalSubmissionRaw\": 51802, \"acRate\": \"34.3%\"}",
|
||||
"stats": "{\"totalAccepted\": \"17.8K\", \"totalSubmission\": \"51.8K\", \"totalAcceptedRaw\": 17794, \"totalSubmissionRaw\": 51803, \"acRate\": \"34.3%\"}",
|
||||
"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