LeetCode First Bad Version278

32 篇文章 0 订阅
20 篇文章 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.

Example:

Given n = 5, and version = 4 is the first bad version.
​
call isBadVersion(3) -> false
call isBadVersion(5) -> true
call isBadVersion(4) -> true
​
Then 4 is the first bad version. 

思路

本体为二分查找的变种,适应于求最小花费的问题

查找第一个1

【0】【0】【0】【0】【1】【1】【1】【1】【1】【1】【max】

min                                mid

min:头指针

max:虚拟尾指针

mid = (min + max) / 2

调整:

如果arr[mid] == 1,min = mid + 1;

如果arr[max] != 1, max = mid;

如果min==max,找到结果

注意:这里的mid要更改为min+(max - min)/ 2,由于样例给的max值变大,那么(min+max)/2有可能会超界

// Forward declaration of isBadVersion API.
bool isBadVersion(int version);

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

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值