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:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/the-kth-factor-of-n.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 688,
"dislikes": 202,
"likes": 712,
"dislikes": 207,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "12\n3\n7\n2\n4\n4",
@@ -131,7 +131,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"85K\", \"totalSubmission\": \"136.9K\", \"totalAcceptedRaw\": 85036, \"totalSubmissionRaw\": 136926, \"acRate\": \"62.1%\"}",
"stats": "{\"totalAccepted\": \"88.3K\", \"totalSubmission\": \"142.2K\", \"totalAcceptedRaw\": 88284, \"totalSubmissionRaw\": 142240, \"acRate\": \"62.1%\"}",
"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."