-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy path278. First Bad Version.py
30 lines (24 loc) · 1.23 KB
/
278. First Bad Version.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
# 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.
# Credits:
# Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.
# Basic Binary Search Problem
# 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,right = 1, n
while left +1 < right:
mid = left + (right - left)/2
if isBadVersion(mid):
right = mid
else:
left = mid
return left if isBadVersion(left) else right