#74 First Bad Version

题目描述：

The code base version is an integer start from 1 to n. One day, someone committed a bad version in the code case, so it caused this version and the following versions are all failed in the unit tests. Find the first bad version.

You can call isBadVersion to help you determine which version is the first bad one. The details interface can be found in the code's annotation part.

 Notice

Please read the annotation in code area to get the correct way to call isBadVersion in different language. For example, Java isSVNRepo.isBadVersion(v)

Have you met this question in a real interview? 

Yes

Example

Given n = 5:

isBadVersion(3) -> false
isBadVersion(5) -> true
isBadVersion(4) -> true

Here we are 100% sure that the 4th version is the first bad version.

Challenge 

You should call isBadVersion as few as possible.

题目思路：

这里可以看到，如果某个index开始为bad version，那么这个index之后都是bad version，数组表现为false false false true true... 所以这个还是典型的二分法，通过不断二分找出第一个true的位置。

Mycode（AC = 10ms）：

/**
 * class SVNRepo {
 *     public:
 *     static bool isBadVersion(int k);
 * }
 * you can use SVNRepo::isBadVersion(k) to judge whether 
 * the kth code version is bad or not.
*/
class Solution {
public:
    /**
     * @param n: An integers.
     * @return: An integer which is the first bad version.
     */
    int findFirstBadVersion(int n) {
        // write your code here
        int l = 1, r = n;
        while (l + 1 < r) {
            int mid = (l + r) / 2;
            
            // versions after mid are all bad, first
            // bad version should be index <= mid
            if (SVNRepo::isBadVersion(mid) == true) {
                r = mid;
            }
            // versions before mid are all good, first
            // bad version should be index > mid
            else {
                l = mid + 1;
            }
        }
        
        return SVNRepo::isBadVersion(l)? l : r;
    }
};