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

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode/originData/closest-divisors.json
View File

@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"20.8K\", \"totalSubmission\": \"34.4K\", \"totalAcceptedRaw\": 20758, \"totalSubmissionRaw\": 34373, \"acRate\": \"60.4%\"}",
"stats": "{\"totalAccepted\": \"20.8K\", \"totalSubmission\": \"34.4K\", \"totalAcceptedRaw\": 20759, \"totalSubmissionRaw\": 34374, \"acRate\": \"60.4%\"}",
"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."