LeetCode 278. First Bad Version

原题链接在这里：https://leetcode.com/problems/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.

题解：

Binary Search. 查mid是不是，若是bad version, 就在左边继续查，若不是bad version, 就在右边继续查找。

最后出了loop是返回left还是right最好举几个例子.

Note: 求中点mid时, 用 mid = left +(right - left)/2, 不能使用 mid = (left + right)/2 因为loop 过程中(left + right)可能超过 Integer.MAX_VALUE, overflow了。

Time Complexity: O(logn). Space: O(1).

AC Java:

 1 /* The isBadVersion API is defined in the parent class VersionControl.
 2       boolean isBadVersion(int version); */
 3 
 4 public class Solution extends VersionControl {
 5     public int firstBadVersion(int n) {
 6         int left = 1;
 7         int right = n;
 8         int res = 0;
 9         while(left<=right){
10             int mid = left + (right - left)/2;
11             if(isBadVersion(mid)){
12                 right = mid-1;
13             }else{
14                 left = mid+1;
15             }
16         }
17         return left;
18     }
19 }

 类似Search Insert Position, Find First and Last Position of Element in Sorted Array.

转载于:https://www.cnblogs.com/Dylan-Java-NYC/p/4839898.html