zoukankan      html  css  js  c++  java
  • 278. First Bad Version

    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. 

    用binary search查找数组1, 2, ...., n-1, n

    初始化l = 0, r = n-1,中点mid。如果mid不是BadVersion,说明左侧都不是BadVersion,应该在右侧[mid+1, r)查找;反之如果mid是BadVersion,说明第一个BadVersion在mid左侧,应该在[l, mid)区间查找,最后返回l

    时间:O(logN),空间:O(1)

    /* The isBadVersion API is defined in the parent class VersionControl.
          boolean isBadVersion(int version); */
    
    public class Solution extends VersionControl {
        public int firstBadVersion(int n) {
            int l = 1, r = n;
            while(l < r) {
                int mid = l + (r - l) / 2;
                if(isBadVersion(mid))
                    r = mid;
                else
                    l = mid + 1;
            }
            return l;
        }
    }
  • 相关阅读:
    浅谈flume
    浅谈storm
    浅谈zookeeper
    IntelliJ IDEA 使用教程
    浅谈spark
    添加本地jar包到maven仓库
    eclipse通过maven进行打编译
    pom.xml中添加远程仓库
    maven编译错误maven-assembly-plugin:2.2-beta-5:assembly (default-cli) on project
    最长上升子序列
  • 原文地址:https://www.cnblogs.com/fatttcat/p/10061986.html
Copyright © 2011-2022 走看看