leetcode1362

class Solution:
    def closestDivisors(self, num: int) -> List[int]:
        d = float("inf")
        res = []
        for i in range(1, int((num + 1) ** 0.5 + 1)):
            if (num + 1) % i == 0:
                if (num + 1) // i - i < d:
                    d = (num + 1) // i - i
                    res = [i, (num + 1) // i]
        for i in range(1, int((num + 2) ** 0.5 + 1)):
            if (num + 2) % i == 0:
                if (num + 2) // i - i < d:
                    d = (num + 2) // i - i
                    res = [i, (num + 2) // i]
        return res

参考：https://leetcode.com/problems/closest-divisors/discuss/518058/python-3-easy-to-understand