zoukankan      html  css  js  c++  java
  • Python3解leetcode 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 def firstBadVersion(self, n):
     2         """
     3         :type n: int
     4         :rtype: int
     5         """
     6         lo , hi = 1, n
     7         while lo < hi:
     8             mid = (lo + hi) // 2
     9             res = isBadVersion(mid)
    10             if res == True:
    11                 hi = mid 
    12             elif res == False:
    13                 lo = mid + 1
    14         
    15         return lo 
  • 相关阅读:
    杜教筛
    单纯形法
    回文树
    模板综合
    不明觉厉的数据结构题2
    gedit脚本
    01分数规划入门
    LCT裸题泛做
    洛谷P4586 [FJOI2015]最小覆盖双圆问题(最小圆覆盖)
    洛谷P1742 最小圆覆盖(计算几何)
  • 原文地址:https://www.cnblogs.com/xiaohua92/p/11314268.html
Copyright © 2011-2022 走看看