coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +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/closest-divisors.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 180,
"dislikes": 81,
"likes": 188,
"dislikes": 82,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "8\n123\n999",
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"15.3K\", \"totalSubmission\": \"25.9K\", \"totalAcceptedRaw\": 15306, \"totalSubmissionRaw\": 25897, \"acRate\": \"59.1%\"}",
"stats": "{\"totalAccepted\": \"15.5K\", \"totalSubmission\": \"26.2K\", \"totalAcceptedRaw\": 15499, \"totalSubmissionRaw\": 26203, \"acRate\": \"59.1%\"}",
"hints": [
"Find the divisors of n+1 and n+2.",
"To find the divisors of a number, you only need to iterate to the square root of that number."