binary search - 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
We can use the idea of binary search to solve this problem in O(logN) time.
We first check the mid, if it is bad, we recursively check the first part, otherwise, we check the second half part.
Java Solution:
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 |
/* The isBadVersion API is defined in the parent class VersionControl. boolean isBadVersion(int version); */ public class Solution extends VersionControl { public int firstBadVersion(int n) { return search(1, n); } int search(int start, int end) { if (start == end) { return start; } int mid = start + (end - start) / 2; boolean isBad = isBadVersion(mid); if (isBad){ return search(start, mid); } else { return search(mid + 1, end); } } } |
