zoukankan      html  css  js  c++  java
  • 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.

    简单题,还是来自师兄的提交,其实实质时寻找第一个为True值的位置,所以很简单,代码如下:

    class Solution(object):
        def firstBadVersion(self, n):
            """
            :type n: int
            :rtype: int
            """
            low = 1
            high = n
            while low<= high:
                mid = low + (high-low)/2
                if isBadVersion(mid):
                    high = mid-1
                else:
                    low = mid+1
            return low

    另外一种会越界然后返回的代码为,运行时间要短一些:

    class Solution(object):
        def firstBadVersion(self, n):
            """
            :type n: int
            :rtype: int
            """
            low = 1
            high = n
            while low<= high:
                mid = low + (high-low)/2
                if isBadVersion(mid):
                    high = mid-1
                else:
                    low = mid+1
            return low
  • 相关阅读:
    HTTP协议抓包分析
    cmd 中使用 tracert
    Ubuntu 搭建zabbix
    kerberos+ldap
    运行程序显示丢失“MSVCR100D.dll”
    熊猫烧香病毒样本分析
    Masm32sdk安装指南
    16位汇编实现三大基本排序
    逆向工程初步160个crackme-------3
    一个入门级CTF的Reverse
  • 原文地址:https://www.cnblogs.com/sherylwang/p/5493662.html
Copyright © 2011-2022 走看看