coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-02 22:13:28 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"6.1K\", \"totalSubmission\": \"11.5K\", \"totalAcceptedRaw\": 6122, \"totalSubmissionRaw\": 11469, \"acRate\": \"53.4%\"}",
"stats": "{\"totalAccepted\": \"6.1K\", \"totalSubmission\": \"11.5K\", \"totalAcceptedRaw\": 6132, \"totalSubmissionRaw\": 11485, \"acRate\": \"53.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."