Leetcode[278] First Bad Version
02 Dec 2015###Task1 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.
###Python
# The isBadVersion API is already defined for you.
# @param version, an integer
# @return a bool
# def isBadVersion(version):
class Solution(object):
def firstBadVersion(self, n):
"""
:type n: int
:rtype: int
"""
left = 0
right = n
while left + 1 < right:
mid = left + (right - left) / 2
if isBadVersion(mid) and not isBadVersion(mid - 1):
return mid
if isBadVersion(mid):
right = mid
else:
left = mid
if isBadVersion(right) and not isBadVersion(left):
return right
else:
return left
###Java
/* The isBadVersion API is defined in the parent class VersionControl.
boolean isBadVersion(int version); */
public class Solution extends VersionControl {
public int firstBadVersion(int n) {
if (n < 0) {
return -1;
}
int left = 1;
int right = n;
while (left + 1 < right) {
int mid = left + (right - left) / 2;
if (!isBadVersion(mid) && isBadVersion(mid + 1)) {
return mid + 1;
}
if (isBadVersion(mid)) {
right = mid;
} else {
left = mid;
}
}
if (isBadVersion(left)) {
return left;
}
return right;
}
}
###Points
- Binary Search