要求:如题
思路:二分的左边界,返回left,只有两种情况,无脑用就行了
// The API isBadVersion is defined for you.
// bool isBadVersion(int version);
class Solution {
public:
int firstBadVersion(int n) {
int left=1,right=n;
while(left<=right){
int mid=left+(right-left>>1);
if(isBadVersion(mid))right=mid-1;
else left=mid+1;
}
return left;
}
};