LeetCode1492. The kth Factor of n

最新推荐文章于 2024-07-24 20:44:05 发布

叶卡捷琳堡

最新推荐文章于 2024-07-24 20:44:05 发布

阅读量510

点赞数 10

文章标签：算法数据结构 leetcode c++

本文链接：https://blog.csdn.net/weixin_46841376/article/details/136834513

版权

本文介绍了一个编程问题，给定两个正整数n和k，目标是找到n的所有因子中第k个，如果n小于k则返回-1。提供了一个时间复杂度为O(n)的解决方案。挑战在于能否在更少的时间复杂度下解决此问题。

摘要由CSDN通过智能技术生成

文章目录

- 一、题目
- 二、题解

一、题目

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: Factors list is [1, 2, 4], there is only 3 factors. We should return -1.

Constraints:

1 <= k <= n <= 1000

Follow up:

Could you solve this problem in less than O(n) complexity?

二、题解

class Solution {
public:
    int kthFactor(int n, int k) {
        int res = 0;
        for(int factor = 1;factor <= n;factor++){
            if(n % factor == 0){
                res++;
                if(res == k) return factor;
            }
        }
        return -1;
    }
};