1 题目描述
2 解题思路
二分查找见:二分查找详解_刘文巾的博客-CSDN博客
class Solution(object):
def firstBadVersion(self, n):
left=1
right=n
while(left<right):
mid=left+(right-left)//2
if(isBadVersion(mid)==True):
right=mid
else:
left=mid+1
return left