leetcode 278: First Bad Version

First Bad Version

Total Accepted: 1415
Total Submissions: 5826

You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on the previous version, all the versions after a bad version
are also bad.

Suppose you have

n

versions

[1, 2, ..., n]

and you want to find out the first bad one, which causes all the following ones to be bad.

You are given an API

bool isBadVersion(version)

which will return whether

version

is bad. Implement a function to find the first bad version. You should minimize the number of calls to the API.

Credits:

Special thanks to
@jianchao.li.fighter for adding this problem and creating all test cases.

[思路]

其实就是二分查找 有重复, 找下界的问题.

[CODE]

/* The isBadVersion API is defined in the parent class VersionControl.
boolean isBadVersion(int version); */

public class Solution extends VersionControl {
public int firstBadVersion(int n) {
int low=1, high=n;

while(low<high) {
int mid=low + (high-low)/2;
if(isBadVersion(mid)) {
high = mid;
} else {
low = mid + 1;
}
}
return low;
}
}