Comment on page
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.
二分法？
// Forward declaration of isBadVersion API.
bool isBadVersion(int version);
class Solution {
int firstBadVersion(int left, int right) {
if(left +1== right) return isBadVersion(left) ?left:right;
int mid=left+(right-left)/2 ;
// cout<<mid<<endl;
return isBadVersion(mid)? firstBadVersion(left,mid) : firstBadVersion(mid,right);
}
public:
int firstBadVersion(int n) {
if(n==1) return 1;
return firstBadVersion(1,n);
}
};
执行用时 :4 ms, 在所有 C++ 提交中击败了73.59%的用户 内存消耗 :8.2 MB, 在所有 C++ 提交中击败了31.63%的用户
Last modified 1yr ago