Package g1201_1300.s1283_find_the_smallest_divisor_given_a_threshold

Class Solution

java.lang.Object

g1201_1300.s1283_find_the_smallest_divisor_given_a_threshold.Solution

public class Solution
extends Object

1283 - Find the Smallest Divisor Given a Threshold.<p>Medium</p> <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&rsquo;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><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [1,2,5,9], threshold = 6</p> <p><strong>Output:</strong> 5</p> <p><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).</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [44,22,33,11,1], threshold = 5</p> <p><strong>Output:</strong> 44</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 5 * 10⁴</code></li> <li><code>1 <= nums[i] <= 10⁶</code></li> <li><code>nums.length <= threshold <= 10⁶</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	smallestDivisor(int[] nums, int threshold)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

smallestDivisor

public int smallestDivisor(int[] nums,
 int threshold)