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.

思路：

这道题很明显用二分查找，使用二分查找后。但输入n = 2126753390,firstBadVersion = 1702766719后，一直超时，后面用Eclipse调试的时候发现，是大数相加溢出造成的。改用long后accept

P.S.注意溢出

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

public class Solution extends VersionControl {
    public int firstBadVersion(int n) {
        long low = 1;
        long high = n;
        long middle = 0;
        while(low <= high){
            middle = (low + high) / 2;
            if(isBadVersion((int)middle)){
                if(middle == 1 || !isBadVersion((int)middle - 1))
                    return (int)middle;
                else
                    high = middle - 1;
            }//if
            else
                low = middle + 1;
        }//while
        
        return -1;
    }
}

 在讨论区看到有解决溢出问题的，没有用long。我觉得很漂亮

middle = low + (high - low) / 2;

P.S.但这尼玛跑的速度居然比用long更长