[LeetCode]--278. First Bad Version

最新推荐文章于 2022-07-30 00:36:39 发布

原创最新推荐文章于 2022-07-30 00:36:39 发布 · 688 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #二分查找算法 #算法 #FirstBad

LeetCode算法分析同时被 2 个专栏收录

115 篇文章 ¥9.90 ¥99.00

订阅专栏

LeetCode

126 篇文章

订阅专栏

这篇博客介绍了如何解决LeetCode上的278题，即找到导致所有后续版本失败的第一个坏版本。文章强调问题的解决方案并不复杂，利用已给出的isBadVersion(version) API，可以有效地找到第一个坏版本，同时提醒读者避免过度复杂化问题。

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.

Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

其实很简单，别想复杂了。isBadVersion(version)这个函数系统已经给了。

了解本专栏