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/four-divisors.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 198,
"dislikes": 145,
"likes": 201,
"dislikes": 146,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[21,4,7]\n[21,21]\n[1,2,3,4,5]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"19.8K\", \"totalSubmission\": \"48.6K\", \"totalAcceptedRaw\": 19783, \"totalSubmissionRaw\": 48624, \"acRate\": \"40.7%\"}",
"stats": "{\"totalAccepted\": \"20.2K\", \"totalSubmission\": \"49.4K\", \"totalAcceptedRaw\": 20189, \"totalSubmissionRaw\": 49414, \"acRate\": \"40.9%\"}",
"hints": [
"Find the divisors of each element in the array.",
"You only need to loop to the square root of a number to find its divisors."