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.

1-n个版本，找出第一个出错的版本。

二分，但是一开始总是超时，想破头，最后发现 l + r会溢出int。

// Forward declaration of isBadVersion API.bool isBadVersion(int version);class Solution {public:    int firstBadVersion(int n) {        long long l = 1, r = n;        while(l <= r)        {            int mid = (l + r) >> 1;            if(isBadVersion(mid)) r = mid - 1;            else l = mid + 1;        }        return l;    }};