We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent cdfb367 commit 838b680Copy full SHA for 838b680
src/main/java/com/fishercoder/solutions/_1283.java
@@ -5,7 +5,8 @@ public static class Solution {
5
6
public int smallestDivisor(int[] nums, int threshold) {
7
8
- int start = 1, result = 0;
+ int start = 1;
9
+ int result = 0;
10
int end = Integer.MAX_VALUE;
11
while (start <= end) {
12
int middle = start + (end - start) / 2;
@@ -22,10 +23,11 @@ public int smallestDivisor(int[] nums, int threshold) {
22
23
private boolean isSumLessThanThreshold(int middle, int[] nums, int threshold) {
24
int sum = 0;
25
for (int i = 0; i < nums.length; i++) {
- if (nums[i] % middle == 0)
26
+ if (nums[i] % middle == 0) {
27
sum += nums[i] / middle;
- else
28
+ } else {
29
sum += nums[i] / middle + 1;
30
+ }
31
}
32
return sum <= threshold;
33
0 commit comments