[LeetCode]278. First Bad Version

最新推荐文章于 2025-02-03 15:37:10 发布

转载最新推荐文章于 2025-02-03 15:37:10 发布 · 278 阅读

文章标签：

#leetcode

leetcode 专栏收录该内容

64 篇文章

订阅专栏

本文介绍了一种高效查找软件中首次出现故障版本的方法。利用二分查找策略，可以在最少的检查次数下确定导致后续版本均故障的首个坏版本。

Easy

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.

17ms:

 public int firstBadVersion(int n) {
        int start = 1, end = n;
        while (start < end) {
            int mid = start + (end-start) / 2;
            if (!isBadVersion(mid)) 
            start = mid + 1;
            else
            end = mid; 
        }
        return start;
    }