描述
给出一个数组,代表版本号,找最开始出错的位置
解决
二分查找
// Forward declaration of isBadVersion API.
bool isBadVersion(int version);
class Solution {
public:
int firstBadVersion(int n) {
int l = 1, r = n;
while (l < r)
{
int m = l + ((r - l) >> 1);
if (isBadVersion(m))
r = m;
else
l = m + 1;
}
if (isBadVersion(l))
return l;
return r;
}
};