278. First Bad Version [easy] (Python)

使用二分搜索法解决LeetCode 278题：First Bad Version

最新推荐文章于 2024-12-09 07:52:14 发布

原创

最新推荐文章于 2024-12-09 07:52:14 发布 · 3.7k 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#python #LeetCode

这篇博客探讨了LeetCode中的278题，即如何找到导致所有后续版本出错的第一个错误版本。文章介绍了问题背景，提供题目链接，并给出两种解题思路，主要利用二分搜索法降低API调用次数。作者提醒读者注意代码实现细节，并欢迎反馈和指正。

题目链接

https://leetcode.com/problems/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.