278. First Bad Version

最新推荐文章于 2024-10-23 13:55:15 发布

xinqrs01

最新推荐文章于 2024-10-23 13:55:15 发布

阅读量143

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/xinqrs01/article/details/55045337

本文介绍了一种使用二分查找算法高效定位首个故障软件版本的方法。通过API判断版本好坏，逐步缩小搜索范围，最终准确找到引入故障的第一个版本。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

s思路:
1. 你看这道题说得还是一件事，分组。看下图，有个边界，左边都是good，右边都是bad。就是分两组，每组都是一样，这不就是已经排好序了吗？所以直接上binary search！
这里写图片描述
2. 突然想到binary search怎么个灵活的？为了handle一个vector,由于vector是两个端点，也就是两个边界，因此左右各放一个哨兵，就可以看到如何变化的，而且这两个哨兵还是独立的运动。有趣！

//方法：binary search
// Forward declaration of isBadVersion API.
bool isBadVersion(int version);

class Solution {
public:
    int firstBadVersion(int n) {
        //
        int l=1,r=n;
        while(l<=r){
            int m=l+(r-l)/2;
            bool cur=isBadVersion(m);
            if(cur) r=m-1;
            else l=m+1;    
        }
        return l;
    }
};