Package g1301_1400.s1362_closest_divisors

Class Solution

java.lang.Object

g1301_1400.s1362_closest_divisors.Solution

public class Solution
extends Object

1362 - Closest Divisors.<p>Medium</p> <p>Given an integer <code>num</code>, find the closest two integers in absolute difference whose product equals <code>num + 1</code> or <code>num + 2</code>.</p> <p>Return the two integers in any order.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> num = 8</p> <p><strong>Output:</strong> [3,3]</p> <p><strong>Explanation:</strong> 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.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> num = 123</p> <p><strong>Output:</strong> [5,25]</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> num = 999</p> <p><strong>Output:</strong> [40,25]</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= num <= 10^9</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int[]	closestDivisors(int num)

Methods inherited from class java.lang.Object

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

Constructor Details

Solution

public Solution()

Method Details

closestDivisors

public int[] closestDivisors(int num)