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.
思路
binary search
代码
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 start = 1, end = n; 7 while (start < end) { 8 // avoid overflow 9 int mid = start + (end-start) / 2; 10 if (!isBadVersion(mid)){ 11 start = mid + 1; 12 } else { 13 end = mid; 14 } 15 } 16 return start; 17 }
转载于:https://www.cnblogs.com/liuliu5151/p/9814311.html
相关资源：数据结构—成绩单生成器