题目出处:https://leetcode-cn.com/problems/first-bad-version/
思路:第一个错误版本之后的版本都是错误的,第一个错误版本之前的版本都是正确的,符合二分查找的性质
// The API isBadVersion is defined for you.
// bool isBadVersion(int version);
class Solution {
public:
int firstBadVersion(int n) {
int l = 1, r = n;
while(l <= r){
int mid = l + ((r-l)>>1);
if(isBadVersion(mid)){ //
r = mid-1;
}else{
l = mid+1;
}
}
return l;
}
};