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

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 212,
"dislikes": 15,
"likes": 222,
"dislikes": 16,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Find Greatest Common Divisor of Array\", \"titleSlug\": \"find-greatest-common-divisor-of-array\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
"exampleTestcases": "2\n4",
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"24.9K\", \"totalSubmission\": \"44.1K\", \"totalAcceptedRaw\": 24908, \"totalSubmissionRaw\": 44108, \"acRate\": \"56.5%\"}",
"stats": "{\"totalAccepted\": \"25.8K\", \"totalSubmission\": \"45.6K\", \"totalAcceptedRaw\": 25803, \"totalSubmissionRaw\": 45650, \"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"