278. First Bad Version

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.

Example:

Given n = 5, and version = 4 is the first bad version.

call isBadVersion(3) -> false
call isBadVersion(5) -> true
call isBadVersion(4) -> true

Then 4 is the first bad version. 

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

public class Solution extends VersionControl {
    public int firstBadVersion(int n) {
        for(int i = 1; i <n; i++){
            if(isBadVersion(i)) return i;
        }
        return n;
    }
}

TLE,害，这不废话吗

/* 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 start = 1, end = n;
        while(start < end){
            int mid = start + (end - start)/ 2;
            if(isBadVersion(mid)){
                end = mid;
            }
            else start = mid + 1;
        }
        return start;
    }
}

二分法就可以了

此题与 https://www.cnblogs.com/wentiliangkaihua/p/11516045.html

find minimum in rotated sorted array一毛一样，都是要找出第一个不符合条件的东西，在这道题是第一个bad ver，153则是最小数。