First Bad Version问题及解法

最新推荐文章于 2025-02-03 15:37:10 发布

原创最新推荐文章于 2025-02-03 15:37:10 发布 · 435 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode Easy #BS

LeetCode算法练习（Easy）专栏收录该内容

156 篇文章

订阅专栏

本文介绍了一种使用二分查找算法高效定位首个故障软件版本的方法。通过API调用判断版本好坏，实现快速查找，大大减少了调用次数。

问题描述：

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 will return whether version is bad. Implement a function to find the first bad version. You should minimize the number of calls to the API.

问题分析：

采用二分查找，时间复杂度O(lg N)，这里有个编程细节：

在求mid中点值时，mid = left + (right - left) / 2比mid = (left + right) / 2运算速度要快。

过程详见代码：

// Forward declaration of isBadVersion API.
bool isBadVersion(int version);

class Solution {
public:
    int firstBadVersion(int n) {
        int left = 1;
        int right = n;
        int mid;
        while(left < right)
        {
            mid = left + (right - left) / 2;
        	if(isBadVersion(mid))
        	{
        		right = mid;
			}
			else 
			{
				left = mid + 1;
			}
			
		}
		return left;
    }
};