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.
基本思路:
折半查扛。
在拆半的过程中,维护一不变式,让stop+1总是指向bad version。
// Forward declaration of isBadVersion API.
bool isBadVersion(int version);
class Solution {
public:
int firstBadVersion(int n) {
int start = 1, stop = n;
while (start <= stop) {
const int mid = start + (stop - start) / 2;
if (isBadVersion(mid))
stop = mid - 1;
else
start = mid + 1;
}
return stop + 1;
}
};