【Leetcode】278. First Bad Version【二分查找】

原创 2016年08月28日 22:17:52

278. First Bad Version

  • Total Accepted: 58296
  • Total Submissions: 248778
  • Difficulty: Easy

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.

Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

Subscribe to see which companies asked this question


思路:二分

1、注意返回条件begin 和 end相等,和一开始调用findRange的条件。

2、这个是找第一个坏版本,所以递归调用的时候isBadVersion(mid)为1时,调用findRange(begin,mid),即不把mid排除,保留0和1的交汇点。

3、mid = (low+high)先发生了数据溢出,应该将其改为mid = low+(high-low)/2      //不知道这么解释对不对。


代码:

public class Solution extends VersionControl {
    public int firstBadVersion(int n) {
        if(n == 1||n == 0) return n;
        int res = findRange(1,n);
        return res;
    }
    
    public int findRange(int begin,int end){
        if(begin == end) return begin;
        
        int mid = begin + (end - begin)/2;
        boolean checkRes = isBadVersion(mid);

        if(checkRes)  
          return findRange(begin,mid);
        else 
          return findRange(mid+1,end);
    }
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

夜深了,她睡的好吗?

每天这个时候都在想这个问题,她晚上常睡不好的,会腿乱动去年的时候她被吓到过,又快到清明了,她一个人在外面,有些担心夜深的时候,总是更想她,呵呵,也更担心她,每天这个时候,屋子里都安静的几乎可以听到自己...

【Leetcode】20. Valid Parentheses【栈】

20. Valid Parentheses Total Accepted: 131984Total Submissions: 427751Difficulty: Easy Given...

第2章 面向对象

重载方法调用继承树中的哪个类的方法是由对象类型在运行时决定的,调用哪个重载方法不是在运行时动态决定的,而是由引用类型决定的!动态性多态仅适用于被重写的实例方法返回类型A类继续于B类,A类重载B类的方法...

【Python学习日记】判断是不是回文数 filter

def is_palindrome(n): n=str(n) m=n[::-1] return n==m tmp_str = str(n) i = len(tmp_str)...

[LeetCode] First Bad Version - 二分查找

题目概述:First Bad Version - 二分查找 最后一个坏的版本 You are a product manager and currently leading a team to dev...

LeetCode 278. First Bad Version

LeetCode 278. First Bad Version 分析与解答

LeetCode笔记:278. First Bad Version

找到一系列版本号中第一个出错的版本号

【LeetCode-278】 First Bad Version(C++)

题目要求:你是一个产品经理领导一个队伍研发一款产品,但是产品的最终版本在质量检测的时候出现了质量上的问题,称之为一个Bad Version。但是每个版本的产品都是基于上一个产品所研发的,如果一个版本出...

LeetCode 278. First Bad Version

题目: You are a product manager and currently leading a team to develop a new product. Unfortunately,...

[LeetCode-278] First Bad Version(二分法注意事项)

You are a product manager and currently leading a team to develop a new product. Unfortunately, the ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)