public int firstBadVersion(int n) {
if(n==0){
return -1;
}
int start = 1, end = n, mid;
while (start + 1 < end) {
mid = start + (end - start)/2;
if (isBadVersion(mid) == false) {
start = mid;
} else {
end = mid;
}
}
if (isBadVersion(start) == true) {
return start;
} else if (isBadVersion(end) == true) {
return end;
} else {
return -1; // not found
}
}
Leetcode:FirstBadVersion
最新推荐文章于 2022-12-06 15:12:26 发布