LeetCode 278. First Bad Version

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

ActiveCoder

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

阅读量211

点赞数

分类专栏： LeetCode 题解

本文链接：https://blog.csdn.net/github_34333284/article/details/51249207

版权

LeetCode 题解专栏收录该内容

288 篇文章 0 订阅

订阅专栏

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.

this is a variation of binary search.

convert the question into this one would be easier: [0, 0, 0, 1, 1] which returns the index of first 1.

    int firstBadVersion(int n) {
        int left = 1, right = n;
        while(left < right) {
            int mid = left + (right - left) / 2;
            if(isBadVersion(mid) == 0) left = mid + 1;
            else right = mid;
        }
        if(isBadVersion(left)) return left;
        return -1;
    }