LeetCode 278. First Bad Version

LeetCode 278. First Bad Version

Description:

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.

---

分析：

简单的一道题，尝试for循环暴力破解，发现超时了。
那么我们就采用二分搜索算法：比较中间数是否为isBadVersion，若是，表示第一个bad version在mid之前，所以更新right为mid，若不是，表示第一个bad version在mid之后，所以更新left为mid+1，循环判断，退出条件为left==right，返回left，则为结果。

代码如下：

// Forward declaration of isBadVersion API.
bool isBadVersion(int version);
class Solution {
public:
    int firstBadVersion(int n) {
        int left = 0, right = n;
        while (left < right) {
            int mid = left + (right - left) / 2;
            if (isBadVersion(mid))
                right = mid;
            else
                left = mid + 1;
        }
        return left;
    }
};
// Time Limit Exceeded
class Solution {
public:
    int firstBadVersion(int n) {
        for (int i = 1; i < n; i++) {
            if (isBadVersion(i)) 
                return i;
        }
        return n;
    }
};