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

题目含义:

每一个项目都是基于前一个提交项目基础上进行设计的，所以如果一个版本出现了错误，那我这个版本之后的所有版本都会出错，要求我们根据给定的API来寻找第一个Bad的版本。

解题思路：

由于每个版本都是基于上一个版本的，因此对于版本号是有序排列的，因此我们可以对1到n的版本使用二分查找，找出第一个错误的版本。

解决方案：

public class Solution extends VersionControl {
       public int firstBadVersion(int n) {
           int start = 1;
           int end   = n;
           while (start + 1 < end) {
               int mid = start + (end - start)/2;
               //这里需要我们注意的是，由于我们要寻找第一个错误的版本，所以当发现错误的版本是，就将该版本后面的版本进行截断。
               if (isBadVersion(mid)) {
                   end = mid;
               } else {
                   start = mid;
               }
           }
           if (isBadVersion(start)) {
               return start;
           }
           return end;
       }
    }

时间复杂度为O(logn),空间复杂度为O(1);