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 whetherversion is bad. Implement a function to find the first bad version. You should minimize the number of calls to the API.

使用二分，主要注意边界处理，使用int的话不能使用mid = (l+r)/2 而要mid = l+ (r-l)/2， 因为会太大了越界。

    // Forward declaration of isBadVersion API.      bool isBadVersion(int version);            class Solution {      public:          int firstBadVersion(int n) {              int l = 1, r = n;              int ans = 0;              while(l <= r){                int mid = l+(r-l)/2;                if(isBadVersion(mid)){                  ans = mid;                  r = mid-1;                } else {                  l = mid+1;                }              }              return ans;          }      };