278. First Bad Version

Problem

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.

Solution

二分查找，顺序查找，结合着来。但是，要思维缜密，把特殊情况考虑进来就好了，就可一次过。

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

class Solution {
public:
    int firstBadVersion(int n) {
        int first = 1, last = n, mid;
        //1--good; 0--bad
        while (first <= last) { 
            mid = first + (last-first)/2;
            //当查找到该区域全为同好或同坏时，往后/前顺序查找
            if (isBadVersion(first) && isBadVersion(last)) { //case: 10000000
                while (first > 1 && isBadVersion(first)) {
                    --first;
                }
                if (first == 1 && isBadVersion(first)) { //case: 0000
                    return 1;
                }
                return first+1;
            }
            else if (!isBadVersion(first) && !isBadVersion(last)) { //case: 111111111100
                while (last < n && !isBadVersion(last)) {
                    ++last;
                }

                if (last == n && !isBadVersion(last)) { //case: 11111111111
                    return -1;
                }
                return last;   
            }//以下为二分查找
            else if (isBadVersion(mid)) { //case: 11110000
                last = mid-1;
            }
            else { //case: 1111000
                first = mid+1;
            }
        }

        return -1;
    }
};

runtime: 0ms

这样做时间并不是很快，可能还有更快的方式，应该是对顺序查找部分进行优化。以后说。