Package g1301_1400.s1362_closest_divisors

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1362 - Closest Divisors\.

    Medium

    Given an integer num, find the closest two integers in absolute difference whose product equals num + 1 or num + 2.

    Return the two integers in any order.

    Example 1:

    Input: num = 8

    Output: 3,3

    Explanation: For num + 1 = 9, the closest divisors are 3 & 3, for num + 2 = 10, the closest divisors are 2 & 5, hence 3 & 3 is chosen.

    Example 2:

    Input: num = 123

    Output: 5,25

    Example 3:

    Input: num = 999

    Output: 40,25

    Constraints:

    • 1 <= num <= 10^9

    • 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 IntArray closestDivisors(Integer num)

      • Methods inherited from class java.lang.Object

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