解题思路:使用二分法,注意整数相加的溢出
// The API isBadVersion is defined for you.
// bool isBadVersion(int version);
class Solution {
public:
int firstBadVersion(int n) {
long left = 1;
long right=n;
long mid=0;
while(left<=right) {
mid=(left+right)/2;
if(!isBadVersion(mid)) {
left = mid+1;
} else {
right = mid-1;
}
}
return left;
}
};