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-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"15.3K\", \"totalSubmission\": \"25.9K\", \"totalAcceptedRaw\": 15295, \"totalSubmissionRaw\": 25880, \"acRate\": \"59.1%\"}",
"stats": "{\"totalAccepted\": \"15.3K\", \"totalSubmission\": \"25.9K\", \"totalAcceptedRaw\": 15306, \"totalSubmissionRaw\": 25897, \"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."