coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-13 19:31:42 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

add leetcode problem-cn part1

Browse Source
This commit is contained in:
小墨
2022-03-27 20:37:52 +08:00
parent 8e542045d1
commit c554fc6908
1285 changed files with 108123 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

37
算法题（国内版）/problem (Chinese)/最接近的因数 [closest-divisors].html Normal file
View File

@@ -0,0 +1,37 @@
<p>给你一个整数&nbsp;<code>num</code>，请你找出同时满足下面全部要求的两个整数：</p>
<ul>
<li>两数乘积等于 &nbsp;<code>num + 1</code>&nbsp;或&nbsp;<code>num + 2</code></li>
<li>以绝对差进行度量，两数大小最接近</li>
</ul>
<p>你可以按任意顺序返回这两个整数。</p>
<p>&nbsp;</p>
<p><strong>示例 1：</strong></p>
<pre><strong>输入：</strong>num = 8
<strong>输出：</strong>[3,3]
<strong>解释：</strong>对于 num + 1 = 9，最接近的两个因数是 3 &amp; 3；对于 num + 2 = 10, 最接近的两个因数是 2 &amp; 5，因此返回 3 &amp; 3 。
</pre>
<p><strong>示例 2：</strong></p>
<pre><strong>输入：</strong>num = 123
<strong>输出：</strong>[5,25]
</pre>
<p><strong>示例 3：</strong></p>
<pre><strong>输入：</strong>num = 999
<strong>输出：</strong>[40,25]
</pre>
<p>&nbsp;</p>
<p><strong>提示：</strong></p>
<ul>
<li><code>1 &lt;= num &lt;= 10^9</code></li>
</ul>