zoukankan      html  css  js  c++  java
  • LeetCode_278. First Bad Version

    278. First Bad Version

    Easy

    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.

    Example:

    Given n = 5, and version = 4 is the first bad version.
    
    call isBadVersion(3) -> false
    call isBadVersion(5) -> true
    call isBadVersion(4) -> true
    
    Then 4 is the first bad version.
    package leetcode.easy;
    /* The isBadVersion API is defined in the parent class VersionControl.
    boolean isBadVersion(int version); */
    
    public class FirstBadVersion extends VersionControl {
    	public int firstBadVersion1(int n) {
    		for (int i = 1; i < n; i++) {
    			if (isBadVersion(i)) {
    				return i;
    			}
    		}
    		return n;
    	}
    
    	public int firstBadVersion2(int n) {
    		int left = 1;
    		int right = n;
    		while (left < right) {
    			int mid = left + (right - left) / 2;
    			if (isBadVersion(mid)) {
    				right = mid;
    			} else {
    				left = mid + 1;
    			}
    		}
    		return left;
    	}
    
    	@org.junit.Test
    	public void test() {
    		FirstBadVersion firstBadVersion = new FirstBadVersion();
    		System.out.println(firstBadVersion.firstBadVersion1(5));
    		System.out.println(firstBadVersion.firstBadVersion2(5));
    	}
    }
    
    class VersionControl {
    	boolean isBadVersion(int version) {
    		if (version >= 4) {
    			return true;
    		} else {
    			return false;
    		}
    	}
    }
    
  • 相关阅读:
    java中栈内存和堆内存的简单理解
    java中构造函数与一般函数的区别

    另一部漫画
    海边的卡夫卡
    11-12
    这篇大概值一百万吧
    我的千岁寒
    11-9
    嗯……………股票已经涨的我不想上班了
  • 原文地址:https://www.cnblogs.com/denggelin/p/11775875.html
Copyright © 2011-2022 走看看