_1891.java

packagecom.fishercoder.solutions.secondthousand;

importjava.util.Arrays;

publicclass_1891 {
publicstaticclassSolution1 {
/*
 * My completely original solution on 1/27/2022.
 */
publicintmaxLength(int[] ribbons, intk) {
longsum = 0L;
intmax = ribbons[0];
for (intnum : ribbons) {
sum += num;
max = Math.max(max, num);
 }
if (sum < k) {
return0;
 } elseif (sum == k) {
return1;
 } else {
Arrays.sort(ribbons);
intleft = 1;
intright = max;
intans = 1;
while (left < right) {
intmid = left + (right - left) / 2;
intcount = 0;
for (inti = ribbons.length - 1; i >= 0; i--) {
count += ribbons[i] / mid;
if (count >= k) {
ans = Math.max(ans, mid);
break;
 }
 }
if (count < k) {
right = mid - 1;
 } else {
left = mid + 1;
 }
 }
intcount = 0;
for (inti = ribbons.length - 1; i >= 0; i--) {
count += ribbons[i] / left;
if (count >= k) {
ans = Math.max(ans, left);
returnans;
 }
 }
returnans;
 }
 }
 }
}