mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 23:41:41 +08:00
update
This commit is contained in:
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"61.1K\", \"totalSubmission\": \"72.2K\", \"totalAcceptedRaw\": 61081, \"totalSubmissionRaw\": 72165, \"acRate\": \"84.6%\"}",
|
||||
"stats": "{\"totalAccepted\": \"61.1K\", \"totalSubmission\": \"72.2K\", \"totalAcceptedRaw\": 61100, \"totalSubmissionRaw\": 72186, \"acRate\": \"84.6%\"}",
|
||||
"hints": [
|
||||
"A guaranteed way to find a multiple of 2 and n is to multiply them together. When is this the answer, and when is there a smaller answer?",
|
||||
"There is a smaller answer when n is even."
|
||||
|
Reference in New Issue
Block a user