文章作者：Tyan
博客：noahsnail.com | CSDN | 简书
First Bad Version
解析：问题变为给定有序数组[1, 2, 2]，找出第一个2的问题，最容易想到的就是二分查找。
class Solution:
def firstBadVersion(self, n):
left = 1
right = n
while left <= right:
mid = (left + right) // 2
if isBadVersion(mid):
if mid == 1 or not isBadVersion(mid - 1):
return mid
right = mid - 1
else:
left = mid + 1
leetcode 278. First Bad Version You are a product manager...
LeetCode 278. First Bad Version Description You are a pro...
278. First Bad Version
题目：278. First Bad Version You are a product manager and c...
You are a product manager and currently leading a team to...
You are a product manager and currently leading a team to...
文章作者：Tyan博客：noahsnail.com[http://noahsnail.com] | CSDN[ht...
278. First Bad Version 二分查找的思路 279. Perfect Squares 使用动态规...
You are a product manager and currently leading a team to...
Problem You are a product manager and currently leading a...
本文标题：Leetcode 278. First Bad Version
本文链接：https://www.haomeiwen.com/subject/eqmwtltx.html
网友评论