[LintCode] First Bad Version

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.

This problem can be converted to given a sorted sequence, find the first element that meets XXXX requirement.

Binary search gives us O(logn) runtime.

 1 public int findFirstBadVersion(int n) {
 2     int start = 1, end = n;
 3     while(start < end - 1) {
 4         int mid = start + (end - start) / 2;
 5         if(SVNRepo.isBadVersion(mid)) {
 6             end = mid;
 7         }
 8         else {
 9             start = mid + 1;
10         }
11     }
12     if(SVNRepo.isBadVersion(start)) {
13         return start;
14     }
15     return end;
16 }