coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/three-divisors.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 211,
"likes": 212,
"dislikes": 15,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Find Greatest Common Divisor of Array\", \"titleSlug\": \"find-greatest-common-divisor-of-array\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"24.9K\", \"totalSubmission\": \"44K\", \"totalAcceptedRaw\": 24852, \"totalSubmissionRaw\": 43985, \"acRate\": \"56.5%\"}",
"stats": "{\"totalAccepted\": \"24.9K\", \"totalSubmission\": \"44.1K\", \"totalAcceptedRaw\": 24908, \"totalSubmissionRaw\": 44108, \"acRate\": \"56.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"