[Java]LeetCode278. 第一个错误的版本 | First Bad Version

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址：https://www.cnblogs.com/strengthen/p/9756798.html 
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

热烈欢迎，请直接点击！！！

进入博主App Store主页，下载使用各个作品！！！

注：博主将坚持每月上线一个新app！！！

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. 

---

你是产品经理，目前正在带领一个团队开发新的产品。不幸的是，你的产品的最新版本没有通过质量检测。由于每个版本都是基于之前的版本开发的，所以错误的版本之后的所有版本都是错的。

假设你有 n 个版本 [1, 2, ..., n]，你想找出导致之后所有版本出错的第一个错误的版本。

你可以通过调用 bool isBadVersion(version) 接口来判断版本号 version 是否在单元测试中出错。实现一个函数来查找第一个错误的版本。你应该尽量减少对调用 API 的次数。

示例:

给定 n = 5，并且 version = 4 是第一个错误的版本。

调用 isBadVersion(3) -> false
调用 isBadVersion(5) -> true
调用 isBadVersion(4) -> true

所以，4 是第一个错误的版本。 

---

10ms

/* The isBadVersion API is defined in the parent class VersionControl.
      boolean isBadVersion(int version); */

public class Solution extends VersionControl {
    public int firstBadVersion(int n) {
        
    int start = 1;
    int end = n;
    while (start < end) {
        int mid = start + (end - start) / 2;
        if (isBadVersion(mid)) {
            end = mid;
        } else {
            start = mid + 1;
        }
    }
    return start;        
    }
}

---

11ms

public class Solution extends VersionControl {
    public int firstBadVersion(int n) {
        // Left included / Right not included will overflow when:
        // n = 2^31 - 1.
        // Thus, use left included / Right included instead.
        int l = 1;
        int r = n;

        while (l <= r) {
            int m = l + (r - l) / 2;

            // Upper bound binary search:
            //  Try to find first index: m, which:
            //  versions[m] -> versions[n-1] are all bad versions.
            //  i.e. m is the first index of bad versions.
            if (isBadVersion(m)) {
                // Search left part.
                r = m - 1;
            } else {
                // Search right part.
                l = m + 1;
            }
        }

        // 'l' is the first index,
        //  which versions[l] -> versions[n-1] are all bad versions,
        return l;
    }
}

---

12ms

public class Solution extends VersionControl {
    public int firstBadVersion(int n) {
        int start = n;
        int end = n;
        while (start > 1 && isBadVersion(start)) {
            end = start;
            start = start / 2;
        }
        
        while (start + 1 < end) {
            int mid = start + (end - start) / 2;
            if (!isBadVersion(mid)) {
                start = mid;
            } else {
                end = mid;
            }
        }
        if (isBadVersion(start)) {
            return start;
        }
        if (isBadVersion(end)) {
            return end;
        }
        return -1;
    }
}

---

13ms

public class Solution extends VersionControl {
    public int firstBadVersion(int n) {
        if (n == 1) {
            return n;
        }
        int start = 1;
        int end = n;
        while (true) {
            int mid = start + (end - start) / 2;
            if (isBadVersion(mid)) {
                if (mid == 0 || !isBadVersion(mid - 1)) {
                    return mid;
                }
                end = mid - 1;
            } else {
                start = mid + 1;
            }
        }
    }
}

---

14ms

public class Solution extends VersionControl {
    public int firstBadVersion(int n) {
        int beginning = 0;
        int end = n; 
        while (beginning < end) {
            
            int middle = beginning + (end - beginning) / 2; 
            System.out.println(beginning + " " + end);

            boolean isBad = isBadVersion(middle); 
            
            if (isBad) {
                end = middle;
            } else {
                beginning = middle + 1; 
            }
        }
        return beginning; 
        
    }
}