-
Notifications
You must be signed in to change notification settings - Fork 40
/
FirstBadVersion.js
81 lines (74 loc) · 2.18 KB
/
FirstBadVersion.js
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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
// Source : https://leetcode.com/problems/first-bad-version
// Author : Dean Shi
// Date : 2017-10-20
/***************************************************************************************
*
* 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 will return whether version is
* bad. Implement a function to find the first bad version. You should minimize the
* number of calls to the API.
*
* Credits:Special thanks to @jianchao.li.fighter for adding this problem and creating
* all test cases.
*
***************************************************************************************/
/**
* Definition for isBadVersion()
*
* @param {integer} version number
* @return {boolean} whether the version is bad
* isBadVersion = function(version) {
* ...
* };
*/
/**
* Iteration
*
* @param {function} isBadVersion()
* @return {function}
*/
var solution = function(isBadVersion) {
/**
* @param {integer} n Total versions
* @return {integer} The first bad version
*/
return function(n) {
let [start, end, mid] = [1, n]
while (start < end) {
mid = ~~((start + end) / 2)
if (isBadVersion(mid)) {
end = mid
} else {
start = mid + 1
}
}
return start
};
};
/**
* Recursion
*
* @param {function} isBadVersion()
* @return {function}
*/
var solution = function(isBadVersion) {
/**
* @param {integer} n Total versions
* @return {integer} The first bad version
*/
return function(n) {
return helper(1, n)
};
function helper(start, end) {
if (start === end) return start
const mid = ~~((start + end) / 2)
return isBadVersion(mid) ? helper(start, mid) : helper(mid + 1, end)
}
};