coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +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/the-kth-factor-of-n.json
View File

@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"9.3K\", \"totalSubmission\": \"14.5K\", \"totalAcceptedRaw\": 9251, \"totalSubmissionRaw\": 14544, \"acRate\": \"63.6%\"}",
"stats": "{\"totalAccepted\": \"9.3K\", \"totalSubmission\": \"14.6K\", \"totalAcceptedRaw\": 9301, \"totalSubmissionRaw\": 14626, \"acRate\": \"63.6%\"}",
"hints": [
"The factors of n will be always in the range [1, n].",
"Keep a list of all factors sorted. Loop i from 1 to n and add i if n % i == 0. Return the kth factor if it exist in this list."