mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
32 lines
1.3 KiB
HTML
32 lines
1.3 KiB
HTML
|
<p>Given an array of integers <code>nums</code> and an integer <code>threshold</code>, we will choose a positive integer <code>divisor</code>, divide all the array by it, and sum the division's result. Find the <strong>smallest</strong> <code>divisor</code> such that the result mentioned above is less than or equal to <code>threshold</code>.</p>
|
||
|
|
|
||
|
|
<p>Each result of the division is rounded to the nearest integer greater than or equal to that element. (For example: <code>7/3 = 3</code> and <code>10/2 = 5</code>).</p>
|
||
|
|
|
||
|
|
<p>The test cases are generated so that there will be an answer.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Example 1:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> nums = [1,2,5,9], threshold = 6
|
||
|
|
<strong>Output:</strong> 5
|
||
|
|
<strong>Explanation:</strong> We can get a sum to 17 (1+2+5+9) if the divisor is 1.
|
||
|
|
If the divisor is 4 we can get a sum of 7 (1+1+2+3) and if the divisor is 5 the sum will be 5 (1+1+1+2).
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 2:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> nums = [44,22,33,11,1], threshold = 5
|
||
|
|
<strong>Output:</strong> 44
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>1 <= nums.length <= 5 * 10<sup>4</sup></code></li>
|
||
|
|
<li><code>1 <= nums[i] <= 10<sup>6</sup></code></li>
|
||
|
|
<li><code>nums.length <= threshold <= 10<sup>6</sup></code></li>
|
||
|
|
</ul>
|