[leetcode]278. First Bad Version[facebook]

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.

我的做法：

用二分查找，重点就在于最后要输出的是什么结果，在这里卡住了，是最后看的答案。

下面分析一下：

首先显然，查找中间的，如果是的话，就往回看，不是的话，就往后看。

We could guess that $left$ and $right$eventually both meet and it must be the first bad version, but how could you tell for sure?

这个问题，我最后返回的是low，但是high不行,(low+high)/2也不行，会错在1 version，1 is the first bad version上。

因为这一题不知道为什么不能直接run，只能submit，所以没有测试。

我怀疑问题可能是出在corner case上。