[LeetCode] 278. 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.

思路: 標準的2分法問題, 題目要求越少存取API 越好. 用2分法可以得到 O(log n)

每次從中間切一刀 然後再做判斷.  關鍵在 line_15 跟 line_19