[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 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.
题目大意：产品经理带领团队开发一个软件产品，但是在发布中有一个软件版本没有通过质量检测，导致以后的版本都无法通过质量检测，尝试判断最早没有通过质量检测的版本。

样例

Example:

Given n = 5, and version = 4 is the first bad version.
call isBadVersion(3) -> false
call isBadVersion(5) -> true
call isBadVersion(4) -> true
Then 4 is the first bad version.

python解法

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

class Solution:
    def firstBadVersion(self, n):
        """
        :type n: int
        :rtype: int
        """
        l, r = 0, n
        while l<=r:
            m = (l+r) // 2
            if isBadVersion(m-1) == False and isBadVersion(m) == True:
                return m
            else:
                if isBadVersion(m) == False:
                    l = m+1
                else:
                    r = m-1
        return -1

Runtime: 36 ms, faster than 65.38% of Python3 online submissions for First Bad Version.
Memory Usage: 13.7 MB, less than 6.90% of Python3 online submissions for First Bad Version.
题后反思：

1. 二分查找法进行查找

C语言解法

// Forward declaration of isBadVersion API.
bool isBadVersion(int version);

int firstBadVersion(int n) {
    long l = 0, r = n;
    int m = 0;
    while (l <= r)
    {
        m = (int)((l+r)/2);
        if (isBadVersion(m-1)==false && isBadVersion(m)==true)
            return m;
        else
        {
            if (isBadVersion(m)==false)
                l = m+1;
            else 
                r = m-1;
        }
    }
    return -1;
}

Runtime: 0 ms, faster than 100.00% of C online submissions for First Bad Version.
Memory Usage: 6.6 MB, less than 100.00% of C online submissions for First Bad Version.
题后反思：

1. 题目给的测试样例两数相加有可能会超出32位带符号整数的范围，所以声明l、r的时候要为long型

文中都是我个人的理解，如有错误的地方欢迎下方评论告诉我，我及时更正，大家共同进步