-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathFirst Bad Version.cpp
More file actions
55 lines (36 loc) · 1.21 KB
/
First Bad Version.cpp
File metadata and controls
55 lines (36 loc) · 1.21 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
// The API isBadVersion is defined for you.
// bool isBadVersion(int version);
int firstBadVersion(int n) {
int lb,ub,mid;
lb=1,ub=n;
while(lb<=ub)
{
if(lb%2 == 0 || ub%2 == 0)
{
mid= lb/2 + ub/2;
}
else{
mid= lb/2 + ub/2 + 1;
}
if(isBadVersion(mid) && (!isBadVersion(mid-1)))
{
break;
}
else if(isBadVersion(mid))
{
ub=mid-1;
}
else{
lb=mid+1;
}
}
return mid;
}
/*
LEETCODE 278
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.
*/