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. 


     1 bool isBadVersion(int version);
     2 
     3 class Solution {
     4 public:
     5     int firstBadVersion(int n) {
     6         int low = 1;
     7         int high = n;
     8         int res = 0;
     9         while(low < high) {
    10             int mid = low + (high - low) / 2;
    11             if(isBadVersion(mid)) {
    12                 high = mid;
    13             } else {
    14                 low = mid+1;
    15             }
    16         }
    17         return high;
    18     }
    19 };
     
  • 相关阅读:
    Java数据结构之栈(Stack)
    Java数据结构之单向环形链表(解决Josephu约瑟夫环问题)
    Java数据结构之双向链表
    zookeeper:JavaApi操作节点
    zookeeper:3
    单例模式
    zookeeper:2
    架构版本
    zookeeper:1
    Java反射
  • 原文地址:https://www.cnblogs.com/zle1992/p/12578531.html
Copyright © 2011-2022 走看看