Lintcode: First Bad Version

The code base version is an integer and start from 1 to n. One day, someone commit a bad version in the code case, so it caused itself and the following versions are all failed in the unit tests.
You can determine whether a version is bad by the following interface: 

Java:
    public VersionControl {
        boolean isBadVersion(int version);
    }
C++:
    class VersionControl {
    public:
        bool isBadVersion(int version);
    };
Python:
    class VersionControl:
        def isBadVersion(version)

Find the first bad version.
Note
You should call isBadVersion as few as possible. 

Please read the annotation in code area to get the correct way to call isBadVersion in different language. For example, Java is VersionControl.isBadVersion.

Example
Given n=5

Call isBadVersion(3), get false

Call isBadVersion(5), get true

Call isBadVersion(4), get true

return 4 is the first bad version

Challenge
Do not call isBadVersion exceed O(logn) times.

就是一个找第一次出现的边沿的题目，方法是Binary Search, 只不过左右指针肯定会重合的，重合之后左指针所在的位置就是左边沿

isBadVersion是个Class Method, 所以调用的方式是类的名字+方法名字

* public class VersionControl {
* public static boolean isBadVersion(int k);
* }

/**
 * public class VersionControl {
 *     public static boolean isBadVersion(int k);
 * }
 * you can use VersionControl.isBadVersion(k) to judge wether 
 * the kth code version is bad or not.
*/
class Solution {
    /**
     * @param n: An integers.
     * @return: An integer which is the first bad version.
     */
    public int findFirstBadVersion(int n) {
        int l = 1;
        int r = n;
        while (l <= r) {
            int m = (l + r) / 2;
            if (VersionControl.isBadVersion(m)) {
                r = m - 1;
            }
            else {
                l = m + 1;
            }
        }
        return l;
    }
}