First Bad Version

First Bad Version 

Boolean数组中找到第一个true.

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.

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.

Solution:

public int findFirstBadVersion(int n) {
    int start = 1;
    int end = n;
    int mid;
    while(start + 1 < end) {
        mid = start + ((end - start) >> 1);
        if(VersionControl.isBadVersion(mid)) {
            end = mid;
        } else {
            start = mid + 1;
        }
    }
    if(VersionControl.isBadVersion(start)) {
        return start;
    } else {
        return end;
    }
}
思路:

在Boolean数组{false,false,false,true,true}中,找到第一个true即可。简单二分查找即可。

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值