forked from HairuoLiu/Coding
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLC278_FirstBadVersion.java
More file actions
58 lines (50 loc) · 1.44 KB
/
Copy pathLC278_FirstBadVersion.java
File metadata and controls
58 lines (50 loc) · 1.44 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
52
53
54
55
56
57
58
/**
* 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.
*
* Example:
*
* Given n = 5
*
* call isBadVersion(3) -> false call isBadVersion(5) -> true call isBadVersion(4) -> true
*
* Then 4 is the first bad version.
*
* @authorLiu.3502
* @created2018-01-31 下午6:45
*/
public class LC278_FirstBadVersion{
public static void main(String[] args) {
int target = 'k';
int ans = firstBadVersion(target);
System.out.println(ans);
}
public static int firstBadVersion(int n) {
//sanity check
if (n == 0) {
return 0;
}
int left = 0,right = n;
while (left <= right){
int mid = left + (right - left)/2;
if(isBadVersion(mid)){
right = mid - 1;
}else if(!isBadVersion(mid)){
left = mid + 1;
}
}
return left;
}
//not really
public static boolean isBadVersion(int version){
return true;
}
}