• Home
• com.github.javadev
• leetcode-in-java
• 1.27
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g1301_1400.s1362_closest_divisors.readme.md Maven / Gradle / Ivy

1362\. Closest Divisors

Medium

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`