LeetCode 278. First Bad Version 第一个错误的代码版本

题目

https://leetcode.com/problems/first-bad-version/description/

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.

Example:

讲解

用二分法可以在 O(logn) 时间复杂度下有效找到第一个出错版本。

视频教学

Java参考代码

发表评论

电子邮件地址不会被公开。 必填项已用*标注