1、直接用二分法第二个模板(注意:需要转为long long)
int firstBadVersion(int n) {
if (n == 0)
return -1;
long long l = 1, r = (long long)n+1;
int mid;
while (l < r) {
mid = l + (r - l) / 2;
if (isBadVersion(mid)) {
r = mid;
}
else {
l = mid + 1;
}
}
if (l != (long long)n+1&&!isBadVersion(l-1))
return l;
return -1;
}
2、官方题解
作者:LeetCode - Solution
链接:https://leetcode-cn.com/problems/first-bad-version/solution/di-yi-ge-cuo-wu-de-ban-ben-by-leetcode-s-pf8h/
来源:力扣(LeetCode)
int firstBadVersion(int n) {
int left = 1, right = n;
while (left < right) { // 循环直至区间左右端点相同
int mid = left + (right - left) / 2; // 防止计算时溢出
if (isBadVersion(mid)) {
right = mid; // 答案在区间 [left, mid] 中
}
else {
left = mid + 1; // 答案在区间 [mid+1, right] 中
}
}
// 此时有 left == right,区间缩为一个点,即为答案
return left;
}