leetcode 278: First Bad Version

解题思路：
类似二分查找，因为本题一定会存在解，所以开始时去除两个边界，left=2, right=n-1,middle = (left + right) / 2，如果middle是好的，left = middle + 1, 否则right = middle - 1，到最后时，left = right + 1，最早的版本一定在这两个里面。

原题：

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.

AC解，C++代码，菜鸟一个，请大家多多指正

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

class Solution {
public:
    int firstBadVersion(int n) {
        if (n < 2) return n;

        int left = 2;
        int right = n - 1;
        while (left <= right) {
            int middle = left + ((right - left) >> 1);
            if (isBadVersion(middle)) {
                right = middle - 1;
            }
            else {
                left = middle + 1;
            }
        }
        if (isBadVersion(right)) {
            return right;
        }
        return left;
    }
};