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 returns whether version is bad. Implement a function to find the first bad version. You should minimize the number of calls to the API.
Example 1:
Input: n = 5, bad = 4
Output: 4
Explanation:
call isBadVersion(3) -> false
call isBadVersion(5) -> true
call isBadVersion(4) -> true
Then 4 is the first bad version.
Example 2:
Input: n = 1, bad = 1
Output: 1
Constraints:
- 1 <= bad <= n <= 231 - 1
第一个错误版本
你是一个产品经理,你的团队在研发一个产品,不幸的是,产品最新版本的质量检查发现错误,由于每个版本都是基于上一个版本开发的,每一个在有错误版本后的版本都是有错误的。
假设你有n个本版本【1,2,3——n】,你想找到第一个导致后面版本都错误的错误版本。
你有一个可以判断版本是不是错误的API bool isBadVersion(version)
,
写一个算法来找出第一个错误版本,要尽量减少api使用次数。
例子1:
输入:n=5,错误=4
输出:4
解释:
调用isBadVersion(3) -> false
调用isBadVersion(4) -> true
调用isBadVersion(5) -> true
4是第一个错误版本
例子2:
输入:n=1,bad=1;
输出:1
限制:
1 <= bad <= n <= 231 - 1