-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1. First Bad Version.cpp
57 lines (41 loc) · 1.34 KB
/
1. First Bad Version.cpp
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
/*
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, and version = 4 is the first bad version.
call isBadVersion(3) -> false
call isBadVersion(5) -> true
call isBadVersion(4) -> true
Then 4 is the first bad version.
*/
class Solution {
public:
long long int firstBadVersion(int n)
{
long long int low=1,high=n;
long long int mid,i;
while(low<=high)
{
mid=(low+high)/2;
if(isBadVersion(mid))
{
if(!isBadVersion(mid-1))
break;
high=mid-1;
}
else
{
low=mid+1;
}
}
return mid;
}
};
// Algorithm: Binary Search
// TC: O(logn(n))
// SC: O(1)