zoukankan      html  css  js  c++  java
  • [LeetCode]First Bad Version

    First Bad Version

    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.

    Credits:
    Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

    二分查找的一般性题目,注意mid=left+(right-left)/2,如果写成mid=(left+right)/2就不对了,因为对于很大的数来说,mid可能大于INT_MAX而越界。

     1 // Forward declaration of isBadVersion API.
     2 bool isBadVersion(int version);
     3 
     4 class Solution {
     5 public:
     6     int firstBadVersion(int n) {
     7         int left=1,right=n;
     8         while(left<=right)
     9         {
    10             int mid = left+(right-left)/2;
    11             if(isBadVersion(mid))
    12             {
    13                 right = mid-1;
    14             }
    15             else
    16             {
    17                 left = mid+1;
    18             }
    19         }
    20         return left;
    21     }
    22 };
  • 相关阅读:
    leetcode刷题29
    leetcode刷题28
    leetcode刷题27
    leetcode刷题23
    leetcode刷题22
    leetcode刷题21
    leetcode刷题20
    Unity中通过DoTween实现转盘效果
    U3D工作注意事项,不要再犯!
    Unity中String字符串的优化
  • 原文地址:https://www.cnblogs.com/Sean-le/p/4813637.html
Copyright © 2011-2022 走看看