#1362

Closest Divisors

specialist · 705 · lc medium +30 · verified · 62.1% accepted · 339 likes · top 63%

Description

Given an integer num, among all pairs of positive integers (a, b) whose product equals num + 1 or num + 2, find the pair with the smallest absolute difference |a - b|. 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]

Code

1

2

3

class Solution:
    def closestDivisors(self, num: int) -> List[int]:

class Solution:
    def closestDivisors(self, num: int) -> List[int]: