Easy 278题 First Bad Version

来源:互联网 发布:catdrawing转换软件 编辑:程序博客网 时间:2024/04/29 19:13

Question:

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.

Solution:

这题很简单~但是自己的方法调用了太多次api,

/* The isBadVersion API is defined in the parent class VersionControl.      boolean isBadVersion(int version); */public class Solution extends VersionControl {    public int firstBadVersion(int n) {        int low=1;        int high=n;        while(low<high)        {            int mid=(high-low)/2+low;            if(isBadVersion(mid)==false)                low=mid+1;            else                high=mid;        }        return low;      /*      if(n==1)        {            return 1;        }        while(low<high)        {            int mid=(high-low)/2+low;            if(isBadVersion(mid)==false && isBadVersion(mid+1)==true)                return mid+1;            else if(isBadVersion(mid)==false && isBadVersion(mid+1)==false)                low=mid+1;            else if(isBadVersion(mid)==true && isBadVersion(mid+1)==true)                high=mid;        }        return high;        */    }}

0 0
原创粉丝点击