278. First Bad Version

1.Question

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.

2.Code

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

class Solution {
public:
    int firstBadVersion(int n) {
        int left = 1;
        int right = n;
        while(left < right)
        {
            int mid = 0.5*(left+right);
            if(isBadVersion(mid))
            {
                if(!isBadVersion(left)) return mid;
                else right = mid-1;
            }
            else left = mid+1;
        }
        return left;
    }
};


3.Note

a. 这题本身没什么,就是通过二分查找找到好版本和坏版本的临界点。这里要提的是leetcode OJ上的坑,就是溢出的问题,求mid = 0.5(left+right)时,left+right会溢出,这时候需要改为mid = left+0.5(right-left)可以避坑。 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值