【leetcode】第一个错误的版本

 

int firstBadVersion(int n) {
    int mid,left=1,right=n;
    while(left<right){
        mid = left + (right-left)/2;
        if (isBadVersion(mid))
            right = mid;
        else
            left=mid+1;
    }
    return left;
}