1492. The kth Factor of n

题目：

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.

Example 4:

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

Example 5:

Input: n = 1000, k = 3
Output: 4
Explanation: Factors list is [1, 2, 4, 5, 8, 10, 20, 25, 40, 50, 100, 125, 200, 250, 500, 1000].

 

Constraints:

• 1 <= k <= n <= 1000

 

思路：

这是一道easy难度的medium。常规做法是循环[1, n]，碰到可以整除n的数，k就减一，当k为0时则找到了正确的数。如果循环结束k还不等于，则说明没有这个数，返回-1，这种情况能够过。稍微可以优化一下，因为在(n/2, n]这一段里，只有n一个可以被n整除。所以我们循环[1, n/2]，其他保持不变。当退出循环时我们判断如果此时k=1，那么n恰好是我们要找的数，否则可以整除的数被用光了，没有这个数，返回-1。

 

代码：

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