LeetCode 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.

代码：

bool isBadVersion(int version);

class Solution {
public:
    int firstBadVersion(int n) 
    {
        int start = 1;
        int end = n;
        int mid;
        while(start <= end)
        {
            mid = start + (end - start)/2;
            if(!isBadVersion(mid))
                start = mid + 1;
            else if(isBadVersion(mid) && !isBadVersion(mid-1))
                return mid;
            else 
                end = mid - 1;
        }
        return mid;
    }
};

不能写成mid = (start + end)/2，这样会造成int溢出的现象，继而超时。

写成 mid = start +(end - start)/2即可