-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathVersionControl.java
More file actions
25 lines (18 loc) · 1.07 KB
/
Copy pathVersionControl.java
File metadata and controls
25 lines (18 loc) · 1.07 KB
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
/* You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on the previous version, all the versions after a bad version are also bad.
Suppose you have n versions [1, 2, ..., n] and you want to find out the first bad one, which causes all the following ones to be bad.
You are given an API bool isBadVersion(version) which returns whether version is bad. Implement a function to find the first bad version. You should minimize the number of calls to the API. */
public class Solution extends VersionControl {
public int firstBadVersion(int n) {
int low = 1;
int high = n;
while (low < high) {
int mid = low + (high - low) / 2;
if (isBadVersion(mid)) {
high = mid; // first bad could be at mid or before
} else {
low = mid + 1; // first bad is after mid
}
}
return low; // or high, both point to the first bad version
}
}