-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathfirstBadFile.py
49 lines (41 loc) · 1.57 KB
/
firstBadFile.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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
# The isBadVersion API is already defined for you.
# @param version, an integer
# @return an integer
# def isBadVersion(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 returns whether version is bad. Implement a function to find the first bad version. You should minimize
the number of calls to the API.
"""
class Solution:
def firstBadVersion(self, n):
"""
:type n: int
:rtype: int
"""
'''
is there always a bad version.
'''
"""
logic
-----
start, end = 0, len(nums) - 1
mid = (start + end) // 2
if we get pushed out of the array, then there are no bad versions
"""
def isBad(version):
if version < 1 or version > n:
return None
return isBadVersion(version)
start, end = 1, n
while start <= end:
mid = (start + end) // 2
if isBad(mid) and isBad(mid - 1):
end = mid - 1
elif not isBad(mid):
start = mid + 1
else:
return mid
return 0