zoukankan      html  css  js  c++  java
  • 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.

    /**
     * Definition for isBadVersion()
     * 
     * @param {integer} version number
     * @return {boolean} whether the version is bad
     * isBadVersion = function(version) {
     *     ...
     * };
     */
    
    /**
     * @param {function} isBadVersion()
     * @return {function}
     */
    var solution=function(isBadVersion){
    	/**
         * @param {integer} n Total versions
         * @return {integer} The first bad version
         */
    
    	return function(n){
    		var start=1;
    		var end=n;
    		while(start<=end){
    			var middle=((end-start)>>1)+start;
    			if(isBadVersion(middle)) end=middle-1;
    			else start=middle+1;
    		}
    		return end+1;
    	};
    };
    
    
  • 相关阅读:
    3305: Hero In Maze II (优先队列+bfs)
    2016年5月8日 GDCPC省赛总结
    POJ 2361 Tic Tac Toe
    about 字节
    KMP模式匹配
    scau 8616 汽车拉力比赛
    海盗分金--大于半数才成立
    scau 10692 XYM-入门之道
    函数模板和类模板成员函数的定义通常放在头文件中
    c语言运算符优先级巧记
  • 原文地址:https://www.cnblogs.com/code-charmer/p/4850135.html
Copyright © 2011-2022 走看看