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.
这道题是找出第一个出错的版本,题目难度为Easy。
二分查找法的题目,比较简单,需要注意的是在用mid = (bgn + end) / 2找中点时越界了,改用mid = bgn + (end - bgn) / 2即可,具体代码:
// Forward declaration of isBadVersion API.
bool isBadVersion(int version);
class Solution {
public:
int firstBadVersion(int n) {
int bgn = 1, end = n, mid;
while(bgn < end) {
mid = bgn + (end - bgn) / 2;
if(isBadVersion(mid)) end = mid;
else bgn = mid + 1;
}
return end;
}
};