思路
有手就行
代码
class Solution:
def kthFactor(self, n: int, k: int) -> int:
factors = []
factor = 1
while(factor <= n):
if(n%factor==0):
factors.append(factor)
factors.append(int(n/factor))
factor += 1
factors = sorted(list(set(factors)))
if(len(factors)<k):
return -1
else:
return factors[k-1]