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.
你是一个产品经理,目前领导一个团队开发一个新产品。不幸的是,你的产品的最新版本的质量检查失败。由于每个版本都是在前一个版本的基础上发展起来的,所有的版本都是不好的。
假设你有1个版本,2,……,你想找出第一个坏的,这会导致所有以下的是坏的。
给你一个API布尔isbadversion(版)将返回是否版本是坏的。实现一个功能,查找第一个坏版本。你应该尽量减少对原料药的调用数量。
// Forward declaration of isBadVersion API.
bool isBadVersion(int version);
class Solution {
public:
int firstBadVersion(int n) {
if (n <= 0) {
return 0;
}
if (isBadVersion(1)) {
return 1;
} else if (!isBadVersion(n)) {
return 0;
}
int left = 1;
int right = n;
int mid;
while (true) {
mid = left + (right - left) / 2; //此处不能用(start+end)/2会产生溢出
if (mid == left) {
return right;
}
if (isBadVersion(mid)) {
right = mid;
} else {
left = mid;
}
}
}
};