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.

从某一个版本开始全部都是坏的版本，找到第一个坏版本。

利用二分查找，注意边界条件即可。

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

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