278.leetcode First Bad Version(easy)[二分查找]

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个version,有一个bad version那么后面的都是bad,现在需要找到第一个bad的version，判断一个version是否是bad有一个可调用的函数isBadVersion.因此采用二分查找的方式，每次查找中间位置的version看是否为bad，如果是的话则肯定第一个bad version在fir与middle之间，否则在middle+1与sec之间。

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

class Solution {
public:
    int firstBadVersion(int fir,int sec)
    {
        //感觉可以采用二分查找的方法
        if(fir<sec)
        {
           int middle = fir+ (sec-fir)/2;
           if(isBadVersion(middle))
           {
              return firstBadVersion(fir,middle);
           }else
           {
             return firstBadVersion(middle+1,sec);
           }
        }
        return fir;
    }
    int firstBadVersion(int n) {
        return firstBadVersion(1,n);
    }
};