LeetCode算法第2篇：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.

代码实现：

// Forward declaration of isBadVersion API.
bool isBadVersion(int version);

int firstBadVersion(int n) {

    int left = 1, right = n;
    int mid;

    while(left < right) {
        mid = left + (right-left) / 2;
        if (isBadVersion(mid)) {
            right = mid;
        } else {
            left = mid+1;
        }
    }

    return left;
}

总结：第10行代码不能写成mid = (left + right) / 2，因为(left+right)可能会溢出，导致提交的时候出现Time Limit Exceeded错误；第12行代码因为mid可能就是第一个坏版本，所以之后的查找要包含第mid个版本，即right = mid；第14行代码，因为mid不是一个坏版本，所以之后的查找不必包含第mid个版本，即left = mid+1。
　　这是个很简单的二分查找的问题，算法思想很简单，但一些细节问题总是处理不好，最后只好又去参考别人的代码了。。。