-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfirstBadVersion.js
More file actions
52 lines (50 loc) · 1.72 KB
/
firstBadVersion.js
File metadata and controls
52 lines (50 loc) · 1.72 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
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
////////////////////////////////////////////////First Bad Version///////////////////////////////////////////
// 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.
// Example 1:
// Input: n = 5, bad = 4
// Output: 4
// Explanation:
// call isBadVersion(3) -> false
// call isBadVersion(5) -> true
// call isBadVersion(4) -> true
// Then 4 is the first bad version.
// Example 2:
// Input: n = 1, bad = 1
// Output: 1
/**
* Definition for isBadVersion()
*
* @param {integer} version number
* @return {boolean} whether the version is bad
* isBadVersion = function(version) {
* ...
* };
*/
/**
* @param {function} isBadVersion()
* @return {function}
*/
const solution = function(isBadVersion) {
/**
* @param {integer} n Total versions
* @return {integer} The first bad version
*/
return function(n) {
let r = n, l = 0;
while(l <= r){
let mid = Math.floor((l + r) / 2);
let version = isBadVersion(mid);
if(version !== isBadVersion(mid + 1)){
return mid + 1
}else if(version === false){
l = mid + 1
}else{
r = mid - 1
}
}
};
};