Closest Divisors LeetCode solution in Python

1
class Solution:
2
    def closestDivisors(self, num: int) -> List[int]:
3
        for i in range(int((num + 2) ** (0.5)), 0, -1):
4
            if not (num + 1) % i:
5
                return [i, (num + 1) // i]
6
            if not (num + 2) % i:
7
                return [i, (num + 2) // i]
8
        return []