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.
思路
本体为二分查找的变种,适应于求最小花费的问题
查找第一个1
【0】【0】【0】【0】【1】【1】【1】【1】【1】【1】【max】
min mid
min:头指针
max:虚拟尾指针
mid = (min + max) / 2
调整:
如果arr[mid] == 1,min = mid + 1;
如果arr[max] != 1, max = mid;
如果min==max,找到结果
注意:这里的mid要更改为min+(max - min)/ 2,由于样例给的max值变大,那么(min+max)/2有可能会超界
// Forward declaration of isBadVersion API.
bool isBadVersion(int version);
int firstBadVersion(int n) {
int min = 0, max = n, mid;
while(min < max){
mid = min + (max - min) / 2;
if(isBadVersion(mid)) max = mid;
else min = mid + 1;
}
return min;
}