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\": \"55.9K\", \"totalSubmission\": \"94.1K\", \"totalAcceptedRaw\": 55938, \"totalSubmissionRaw\": 94100, \"acRate\": \"59.4%\"}",
|
||||
"stats": "{\"totalAccepted\": \"56K\", \"totalSubmission\": \"94.1K\", \"totalAcceptedRaw\": 55957, \"totalSubmissionRaw\": 94123, \"acRate\": \"59.5%\"}",
|
||||
"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