-
Notifications
You must be signed in to change notification settings - Fork 1
/
MinimumDaysToBloom.java
58 lines (49 loc) · 1.37 KB
/
MinimumDaysToBloom.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
package com.abn.dsalgos.algo.binarySearch;
public class MinimumDaysToBloom {
public int minDaysBloom(int[] a, int k, int n) {
if (a == null || n == 0 || k == 0) {
return 0;
}
if (n * k > a.length) {
return -1;
}
int l = Integer.MAX_VALUE;
int r = Integer.MIN_VALUE;
for (int val : a) {
l = Math.min(l, val);
r = Math.max(r, val);
}
while (l <= r) {
int mid = l + (r - l) / 2;
if (isValid(a, k, n, mid)) {
r = mid - 1;
} else {
l = mid + 1;
}
}
return l;
}
public boolean isValid(int a[], int size, int count, int day) {
int curcount = 0;
int cursize = 0;
for (int val : a) {
if (val <= day) {
cursize++;
} else {
cursize = 0;
}
if (cursize == size) {
cursize = 0;
curcount++;
}
if (curcount == count) {
return true;
}
}
return false;
}
public static void main(String[] args) {
MinimumDaysToBloom minimumDaysToBloom = new MinimumDaysToBloom();
minimumDaysToBloom.minDaysBloom(new int[] {1, 10, 2, 9, 3, 8, 4, 7, 5, 6}, 4, 2);
}
}