Leetcode---278---二分法之发现第一个错误的版本

未错误之前的都为False，错误之后的都为True，找到刚好发生错误的哪一个节点出来
关键信息：3种状态
False、False，
True、True,
False、True,
当前节点的结果取反乘以下一个结果如果结果仍然为True，则找到该节点的下一个点即为发生错误的点

# 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
        """
        min_idx=1
        max_idx=n
        if isBadVersion(1):
            return 1
        
        while max_idx>=min_idx:
            mid_idx=(min_idx+max_idx)//2
            cur=isBadVersion(mid_idx)
            result=(1-cur)&isBadVersion(mid_idx+1)
            if result:
                return mid_idx+1
            elif cur==True:
                max_idx=mid_idx-1
            else: 
                min_idx=mid_idx+1