整理思路:这个暴力解法是允许超时的。所以想到最快的二分法。
/* 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 min = 1, max = n, mid = 0;
while(min <= max){
mid = min + (max - min) / 2;
if(isBadVersion(mid)){
max = mid - 1;
} else {
min = mid + 1;
}
}
return min;
}
}