closest-divisors

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given an integer <code>num</code>, find the closest two integers in absolute difference whose product equals&nbsp;<code>num + 1</code>&nbsp;or <code>num + 2</code>.

Return the two integers in any order.

&nbsp;
Example 1:

<pre>
Input: num = 8
Output: [3,3]
Explanation: For num + 1 = 9, the closest divisors are 3 &amp; 3, for num + 2 = 10, the closest divisors are 2 &amp; 5, hence 3 &amp; 3 is chosen.
</pre>

Example 2:

<pre>
Input: num = 123
Output: [5,25]
</pre>

Example 3:

<pre>
Input: num = 999
Output: [40,25]
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= num &lt;= 10^9</code></li>
</ul>

closestDivisors

Closest Divisors

Distinct Prime Factors of Product of Array

distinct-prime-factors-of-product-of-array

数组乘积中的不同质因数数目

Math

给你一个整数&nbsp;<code>num</code>，请你找出同时满足下面全部要求的两个整数：

<ul>
	<li>两数乘积等于 &nbsp;<code>num + 1</code>&nbsp;或&nbsp;<code>num + 2</code></li>
	<li>以绝对差进行度量，两数大小最接近</li>
</ul>

你可以按任意顺序返回这两个整数。

&nbsp;

示例 1：

<pre>输入：num = 8
输出：[3,3]
解释：对于 num + 1 = 9，最接近的两个因数是 3 &amp; 3；对于 num + 2 = 10, 最接近的两个因数是 2 &amp; 5，因此返回 3 &amp; 3 。
</pre>

示例 2：

<pre>输入：num = 123
输出：[5,25]
</pre>

示例 3：

<pre>输入：num = 999
输出：[40,25]
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= num &lt;= 10^9</code></li>
</ul>