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

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"177.9K\", \"totalSubmission\": \"268.8K\", \"totalAcceptedRaw\": 177868, \"totalSubmissionRaw\": 268773, \"acRate\": \"66.2%\"}",
"stats": "{\"totalAccepted\": \"177.9K\", \"totalSubmission\": \"268.9K\", \"totalAcceptedRaw\": 177938, \"totalSubmissionRaw\": 268878, \"acRate\": \"66.2%\"}",
"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."