[278]First Bad Version

最新推荐文章于 2022-08-14 12:58:51 发布

sadjuno

最新推荐文章于 2022-08-14 12:58:51 发布

阅读量162

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/sadjuno/article/details/48895443

版权

leetcode 专栏收录该内容

140 篇文章 0 订阅

订阅专栏

【题目描述】

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.

【思路】

就是一道二分查找的题目，要注意的一点是(low+high)/2的时候可能会溢出，所以要改写成low+(high-low)/2.所以说代码真的很神奇呀~

【代码】

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

class Solution {
public:
    int firstBadVersion(int n) {
      int low=1;
      int high=n;
      while(low<=high){
          int middle=low + ( high - low ) / 2;
          if(isBadVersion(middle)==true&&isBadVersion(middle-1)==false) return middle;
          if(isBadVersion(middle)==true&&isBadVersion(middle-1)==true) high=middle-1;
          if(isBadVersion(middle)==false) low=middle+1;
      }
    }
};