題目:原題鏈接(簡單)
解法 | 時間複雜度 | 空間複雜度 | 執行用時 |
---|---|---|---|
Ans 1 (Python) | O(logn) | O(1) | 40ms (61.99%) |
Ans 2 (Python) | O(logn) | O(1) | 36ms (83.47%) |
LeetCode的Python執行用時隨緣,只要時間複雜度沒有明顯差異,執行用時一般都在同一個量級,僅作參考意義。
解法一(二分法查找):
def firstBadVersion(self, n):
left, right = 0, n
while (right - left) > 1:
binery = left + (right - left) // 2
binery_ans = isBadVersion(binery)
if binery_ans:
right = binery
else:
left = binery
return right
解法二(另一種二分查找):
def firstBadVersion(self, n):
left, right = 0, n
while right > left:
binery = left + (right - left) // 2
binery_ans = isBadVersion(binery)
if binery_ans:
right = binery
else:
left = binery + 1
return left