First Bad Version

最新推荐文章于 2024-11-06 09:58:18 发布

673556617-real

最新推荐文章于 2024-11-06 09:58:18 发布

阅读量210

点赞数

分类专栏：算法 leetcode

本文链接：https://blog.csdn.net/awawfwfw/article/details/53476891

版权

算法同时被 2 个专栏收录

243 篇文章 0 订阅

订阅专栏

leetcode

225 篇文章 0 订阅

订阅专栏

The code base version is an integer start from 1 to n. One day, someone committed a bad version in the code case, so it caused this version and the following versions are all failed in the unit tests. Find the first bad version.

You can call isBadVersion to help you determine which version is the first bad one. The details interface can be found in the code's annotation part.

Notice

Please read the annotation in code area to get the correct way to call isBadVersion in different language. For example, Java is SVNRepo.isBadVersion(v)

Have you met this question in a real interview?

Yes

Example

Given n = 5:

isBadVersion(3) -> false
isBadVersion(5) -> true
isBadVersion(4) -> true

Here we are 100% sure that the 4th version is the first bad version.

标准的二分题。

对于true的话，说明结果在mid的左边，包含左边；如果为false，那么一定在后侧，low = mid+1

代码：

public int findFirstBadVersion(int n) {
        // write your code here
        //找左边界
        int low = 0;
        int high = n;
        while(low<high){
            int mid = low + (high - low)/2;
            boolean temp = SVNRepo.isBadVersion(mid);
            if(temp){
                high = mid;
            }else {
                low = mid +1;
            }
        }
        return low;
    }