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. 
    
     

    Approach #1:

    // Forward declaration of isBadVersion API.
    bool isBadVersion(int version);
    
    class Solution {
    public:
        int firstBadVersion(int n) {
            int l = 1;
            int r = n;
            int m;
            while (l <= r) {
                m = l + (r - l) / 2;
                if (isBadVersion(m)) r = m - 1;
                else l = m + 1;
            }
            return l;
        }
    };
    

    Runtime: 0 ms, faster than 100.00% of C++ online submissions for First Bad Version.

    Analysis:

    1. using m = l + (r - l) / 2; otherwise it will voerflow .

    永远渴望,大智若愚(stay hungry, stay foolish)
  • 相关阅读:
    hdu6761 Mininum Index // lyndon分解 + duval贪心 + 秦九韶算法
    hdu6762 Mow // 半平面交 模拟 双端队列
    数据库增删改查操作
    移动端自动化概念
    范围查询和模糊查询
    软件测试技能要求总结
    继承
    luogu_P2024 [NOI2001]食物链
    luogu_P4092 [HEOI2016/TJOI2016]树
    luogu_P2887 [USACO07NOV]防晒霜Sunscreen
  • 原文地址:https://www.cnblogs.com/h-hkai/p/9890851.html
Copyright © 2011-2022 走看看