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.

用二分法，设定两个指针，分别指向数组的头和尾。如果中间的version是坏的，说明坏的version在左边，就让右指针左移；如果中间的version是好的，说明坏的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) {
        int l = 1;
        int r = n;
        while(l <= r) {
            int m = l + (r - l) / 2;
            if(isBadVersion(m))
                r = m - 1;
            else
                l = m + 1;
        }
        return l;
    }
}