1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35
|
public class {
public int findFirstBadVersion(int n) { int start = 1, end = n;
while (start + 1 < end) { int mid = start + (end - start) / 2; if (SVNRepo.isBadVersion(mid)) { end = mid; } else { System.out.println(start); start = mid; } } if (SVNRepo.isBadVersion(start)) { return start; } else { return end; }
} }
|
近期评论