Leetcode: First Bad Version

Question

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.

Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

Hide Tags Binary Search
Hide Similar Problems (M) Search for a Range (M) Search Insert Position

---

My Solution

# 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 n==0:
            return 0

        l, r = 1, n
        while l<=r:
            m = (l+r)/2

            if isBadVersion(m):
                if r-l<=1:
                    return l
                else:
                    r = m
            else:
                if r-l<=1:
                    return r
                else:
                    l = m

---

Solution

Get idea from here.

# 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 n==0:
            return 0

        l, r = 1, n
        while l<r:
            m = (l+r)/2

            if isBadVersion(m):
                r = m
            else:
                l = m + 1

        return l

This is a succinct solution.
Note that we change the rule of updating l and r.