【Python Leetcode】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 returns whether version is bad. Implement a function to find the first bad version. You should minimize the number of calls to the API.

Example 1:

Input: n = 5, bad = 4
Output: 4
Explanation:
call isBadVersion(3) -> false
call isBadVersion(5) -> true
call isBadVersion(4) -> true
Then 4 is the first bad version.

Example 2:

Input: n = 1, bad = 1
Output: 1

Constraints:

1 <= bad <= n <= 2³¹ - 1

思路：二分法

左侧为正常版本，右侧为异常版本，则第一个异常版本必在左右之间。第一个异常版本的前一个版本必为正常版本。取其中点检测是否为第一个异常版本，是则返回；若中点为正常版本，则将左端口移至中点处；若中点异常但非第一个异常版本，则将右端口移至中点处。

特殊情况处理：

• 初始版本即为第一个异常版本，直接返回
• 左右端口相邻，分别检测左右端口是否为首个异常版本

# The isBadVersion API is already defined for you.
# @param version, an integer
# @return a bool
# def isBadVersion(version):

class Solution(object):
    def firstBadVersion(self, n):
        """
        :type n: int
        :rtype: int
        """
        
        if isBadVersion(1):
            return 1
        
        left = 1
        right = n
        mid = (left+right)/2
        
        while left <= right:
            if left == mid:
                if isBadVersion(left):
                    return left
                elif isBadVersion(right):
                    return right
            if isBadVersion(mid) and not(isBadVersion(left)):
                right = mid
            elif isBadVersion(right) and not(isBadVersion(mid)): 
                left = mid
            mid = (left+right)/2