【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....n中第一个bad的数。要求尽可能少的调用isBadVersion这个API

思路：二分查找，设定一个left初始化为1，一个right初始化为n。如果left就是bad，返回left。如果right是good，返回right+1。否则就是left是good，right是bad，于是查看中间的值mid = left+（right-left）/2，如果中间值是bad，right = mid，如果中间值是good，left = mid。注意到当left 和right 相邻时（即right - left =1），如果left 是good，right是bad，那么就会一直死循环，所以要加一个判断条件，如果出现这种情况直接返回right。

这里特别要注意的一点就是溢出的情况。一开始我也是没注意，老是Time Limit Exceeded。算中间值的时候不能用 mid = (left+right)/2，因为left+right可能会溢出。这里采用 mid = left+(right - left)/2 的形式，很顺利地就AC了。

c++代码（0ms，13.45%）

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

class Solution {
public:
    int firstBadVersion(int n) {
        if(n==0)
            return 0;
        int left=1;
        int right=n;
        if(isBadVersion(left))
            return left;
        while(left<right){
            if(!(isBadVersion(right))){
                return right+1<n?right+1:right;  
            }//if
            while(left<right && isBadVersion(left+(right-left)/2)){
                right = left+(right-left)/2;
            }//while
            if(left<right){
                left=left+(right-left)/2;
            }
            if(left==right-1 && isBadVersion(right))
                return right;
        }//while
        return left+1<n?left+1:left;
    }
};

自己写的代码很难看，上一份别人写的简洁优雅的代码：

注意left初始化为0

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

class Solution {
public:
    int firstBadVersion(int n) {
        int left=0;
        int right=n;
        while(right-left>1){
            int mid = left+(right-left)/2;
            if(isBadVersion(mid)) right = mid;
            else left = mid;
        }//while
        return right;
    }
};