运行结果
代码
class Solution {
public:
int firstBadVersion(int n) {
int beg = 1, end = n;
while(beg != end){
int mid = beg + (end - beg) / 2;
isBadVersion(mid) ? end = mid : beg = mid + 1;
}
return beg;
}
};