关闭

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

标签: 函数leetcode二分查找
62人阅读 评论(0) 收藏 举报
分类:

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);
    }
}


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:42865次
    • 积分:1209
    • 等级:
    • 排名:千里之外
    • 原创:65篇
    • 转载:101篇
    • 译文:1篇
    • 评论:4条
    文章分类