_1283.java

packagecom.fishercoder.solutions.secondthousand;

publicclass_1283 {
publicstaticclassSolution {

publicintsmallestDivisor(int[] nums, intthreshold) {

intstart = 1;
intresult = 0;
intend = Integer.MAX_VALUE;
while (start <= end) {
intmiddle = start + (end - start) / 2;
if (isSumLessThanThreshold(middle, nums, threshold)) {
result = middle;
end = middle - 1;
 } else {
start = middle + 1;
 }
 }
returnresult;
 }

privatebooleanisSumLessThanThreshold(intmiddle, int[] nums, intthreshold) {
intsum = 0;
for (inti = 0; i < nums.length; i++) {
if (nums[i] % middle == 0) {
sum += nums[i] / middle;
 } else {
sum += nums[i] / middle + 1;
 }
 }
returnsum <= threshold;
 }
 }
}