First Bad Version
- 1 min read
- LC-Easy
- Binary-search
3 years ago
Solution
- Literally just a binary search
| Time | Space | Explanation |
|---|---|---|
O(log n) | O(1) |
def firstBadVersion(self, n: int) -> int:
start, end = 1, n
while start < end:
mid = (start + end) // 2
isBad = isBadVersion(mid)
if isBad:
end = mid
else:
start = mid + 1
return start