[leetcode] 1362. Closest Divisors

Description

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

分析

题目的意思是：给定数num，求出num+2，num+1中的整除的数，找出绝对值差别最小的一个。读完题目，我自觉的把num+1和num+2两种整除的数都找出来，然后挑选了绝对值差最小的一个。后面发发现别人的思路不错，首先还是遍历找整除的数，不过是从sqrt(num+2）的位置从后往前找，因为处于平方根位置的能够被整除的数绝对值差肯定最小啦。所以找到第一个符合条件的就是答案了。

代码

class Solution:
    def closestDivisors(self, num: int) -> List[int]:
        for x in range(int(sqrt(num+2)),0,-1):
            if((num+1)%x==0):
                return [x,(num+1)//x]
            elif((num+2)%x==0):
                return [x,(num+2)//x]

参考文献

[Java/C++/Python] Easy and Concise