leet278. 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.

分析：

1. 要求减小调用次数，同时坏版本出现在连续区域，适合使用二分法查找
   

代码：

class Solution(object):
    def firstBadVersion(self, n):
        """
        :type n: int
        :rtype: int
        """
        def binSearch(p,q):
            # print '(%d,%d)' %(p,q)
            if p < q:
                mid = (p + q) // 2
                if isBadVersion(mid):
                    return binSearch(p,mid)
                else:
                    return binSearch(mid + 1,q)
            return p
        return binSearch(1,n)

思考：

1. 可以使用二分法库函数bisect，代码如下（来自leetcode的StefanPochmann）：
   

def firstBadVersion(self, n):
    class Wrap:
        def __getitem__(self, i):
            return isBadVersion(i)
    return bisect.bisect(Wrap(), False, 0, n)