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.

你是一个产品经理，目前正带领一支团队研发一种新的产品。不幸的是，产品的最新版本没有通过质量检查。由于产品的每个版本都基于前一个版本，这意味着坏版本之后的版本也一定是坏的。

假定存在 n 个版本 [1, 2, ..., n] ，而你想要找出导致后来出错的最开始那一个坏版本。

你有一个API bool isBadVersion(version) ，它能够返回第 version 个版本是否是坏的。实现一个函数来找出第一个坏版本。你应该尽可能少的调用API。

二分查找，我用的是递归，非递归的可以百度一下，不赘述了。

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

class Solution {
public:
    int firstBadVersion(int n) {
        return test(1,n);
    }
    int test(int beg,int end){
        if(beg==end) return beg;
        int s1=beg,s2=end;
        int mid=beg+(end-beg)/2;
        if(isBadVersion(mid)) return test(s1,mid);
        else return test(mid+1,s2);
    }
};