mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-02 22:13:28 +08:00
update
This commit is contained in:
@@ -137,7 +137,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"8.8K\", \"totalSubmission\": \"16.2K\", \"totalAcceptedRaw\": 8800, \"totalSubmissionRaw\": 16157, \"acRate\": \"54.5%\"}",
|
||||
"stats": "{\"totalAccepted\": \"9.2K\", \"totalSubmission\": \"16.8K\", \"totalAcceptedRaw\": 9166, \"totalSubmissionRaw\": 16844, \"acRate\": \"54.4%\"}",
|
||||
"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