leetcode 278. First Bad Version (第一个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.

可以调用一个isBadVersion的函数来查看当前version是否为badVersion，而且要找到最早的badVersion，因为在开发中，最早的badVersion之后的version都是badVersion

思路：
binarySearch, mid处的version为badVersion时，要看它之前是否还有badVersion，所以right=mid-1
mid处为false时，要在它之后找badVersion，left=mid+1

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

public class Solution extends VersionControl {
    int firstVersion;
    
    public int firstBadVersion(int n) {
        binarySearch(1, n);
        return firstVersion;
    }
    
    public void binarySearch(int left, int right) {        
        while(left < right) {
            int mid = left + (right - left) / 2;
            if (isBadVersion(mid)) {
                firstVersion = mid;
                right = mid - 1;
            } else {
                left = mid + 1;
            }
        }
        
        if(isBadVersion(right)) {
            firstVersion = right;
        }
    }
}