LeetCode 1492. The kth Factor of n - 亚马逊高频题4

CP Coding

于 2022-03-14 22:18:06 发布

阅读量651

点赞数 1

分类专栏： Leetcode刷题笔记亚马逊高频题优先级队列文章标签： leetcode 算法 python

本文链接：https://blog.youkuaiyun.com/hgq522/article/details/123489447

版权

该博客介绍了如何解决LeetCode上的第1492题，即找出正整数n的第k个因子。通过使用优先级队列（最大堆）优化了寻找过程，避免了简单的遍历方法，确保在O(sqrt(n))的时间复杂度内找到答案。文章详细解释了算法思路和实现过程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

You are given two positive integers n and k. A factor of an integer n is defined as an integer i where n % i == 0.

Consider a list of all factors of n sorted in ascending order, return the kth factor in this list or return -1 if n has less than k factors.

Example 1:

Input: n = 12, k = 3
Output: 3
Explanation: Factors list is [1, 2, 3, 4, 6, 12], the 3rd factor is 3.

Example 2:

Input: n = 7, k = 2
Output: 7
Explanation: Factors list is [1, 7], the 2nd factor is 7.

Example 3:

Input: n = 4, k = 4
Output: -1
Explanation: Facto

最低0.47元/天解锁文章