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

翻译：

你是一个产品经理当前正带领团队开发一个新的产品。不幸的是，你最新版本的产品没有通过质量审核。因为每一个版本的开发都基于前一个版本，一旦有一个版本是坏的，所有之后的版本都是坏的。

假设你有 n 个版本 [1, 2, ..., n] 并且你想要找出第一个坏的从而导致后面的版本都坏了的那个。

你被给定一个接口 bool isBadVersion(version) 能够返回 Version 是否是坏的。实现一个函数来找到第一个坏的版本。你应该最小化调用接口的次数。

思路：

思路很简单，因为该题明显是一道二分查找问题，但是，却一直 TLE , 后来几经排查对比，发现问题出在mid的计算上，若用mid=（left + right） /2 一直会报错超时，解决方案是用mid=left + (right-left)/2来计算。

C++代码（Visual Studio 2017）：

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

class Solution {
public:
	int firstBadVersion(int n) {
		int low = 1;
		int high = n;
		while (low<high) {
			int mid = low + (high - low) / 2;   //Attention!! (left + right)/2 could overflow. One way to fix this is to use left + (right-left)/2;
			if (isBadVersion(mid))
				high = mid;
			else
				low = mid + 1;
		}
		return low;
	}
};