mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 23:41:41 +08:00
update
This commit is contained in:
@@ -143,7 +143,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"16K\", \"totalSubmission\": \"29K\", \"totalAcceptedRaw\": 16021, \"totalSubmissionRaw\": 29027, \"acRate\": \"55.2%\"}",
|
||||
"stats": "{\"totalAccepted\": \"16K\", \"totalSubmission\": \"29K\", \"totalAcceptedRaw\": 16023, \"totalSubmissionRaw\": 29029, \"acRate\": \"55.2%\"}",
|
||||
"hints": [
|
||||
"You can count the number of divisors and just check that they are 3",
|
||||
"Beware of the case of n equal 1 as some solutions might fail in it"
|
||||
|
Reference in New Issue
Block a user