1.Question
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.
// Forward declaration of isBadVersion API.
bool isBadVersion(int version);
class Solution {
public:
int firstBadVersion(int n) {
int left = 1;
int right = n;
while(left < right)
{
int mid = 0.5*(left+right);
if(isBadVersion(mid))
{
if(!isBadVersion(left)) return mid;
else right = mid-1;
}
else left = mid+1;
}
return left;
}
};
a. 这题本身没什么,就是通过二分查找找到好版本和坏版本的临界点。这里要提的是leetcode OJ上的坑,就是溢出的问题,求mid = 0.5(left+right)时,left+right会溢出,这时候需要改为mid = left+0.5(right-left)可以避坑。