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

    Description
    The code base version is an integer start from 1 to n. One day, someone committed a bad version in the code case, so it caused this version and the following versions are all failed in the unit tests. Find the first bad version.

    You can call isBadVersion to help you determine which version is the first bad one. The details interface can be found in the code's annotation part.

    Notice

    Please read the annotation in code area to get the correct way to call isBadVersion in different language. For example, Java is SVNRepo.isBadVersion(v)


    Example
    Given n = 5:

    isBadVersion(3) -> false
    isBadVersion(5) -> true
    isBadVersion(4) -> true
    Here we are 100% sure that the 4th version is the first bad version.


    Challenge
    You should call isBadVersion as few as possible.

    4/24/2017

    算法班

     1 class Solution {
     2     /**
     3      * @param n: An integers.
     4      * @return: An integer which is the first bad version.
     5      */
     6     public int findFirstBadVersion(int n) {
     7         // write your code here
     8         if (n <= 0) return -1;
     9         int start = 0, end = n;
    10         
    11         while (start + 1 < end) {
    12             int mid = start + (end - start) / 2;
    13             if (!SVNRepo.isBadVersion(mid)) {
    14                 start = mid;
    15             } else {
    16                 end = mid;
    17             }
    18         }
    19         if (SVNRepo.isBadVersion(start)) return start;
    20         else return end;
    21     }
    22 }
  • 相关阅读:
    子序列自动机
    poj 暴力水题
    小白贪心题
    组合数+费马大/小定理
    随机数法
    vector的二维用法+前缀和
    巨思维题
    思维水题
    Codeforces Round #323 (Div. 2) D.Once Again... (nlogn LIS)
    Codeforces Round #325 (Div. 2) D. Phillip and Trains (BFS)
  • 原文地址:https://www.cnblogs.com/panini/p/6760954.html
Copyright © 2011-2022 走看看