Package g1401_1500.s1492_the_kth_factor_of_n

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1492 - The kth Factor of n\.

    Medium

    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 <code>k<sup>th</sup></code> 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 3<sup>rd</sup> factor is 3.

    Example 2:

    Input: n = 7, k = 2

    Output: 7

    Explanation: Factors list is 1, 7, the 2<sup>nd</sup> 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 &lt;= k &lt;= n &lt;= 1000

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer kthFactor(Integer n, Integer k)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait