第一个错误的版本

[lzxjack]

No description provided.

[lzxjack]

const solution = isBadVersion => n => {
  let [left, right] = [1, n];

  // 假设n是第一个错误版本
  let res = n;
  while (left <= right) {
    const mid = (left + right) >>> 1;
    if (isBadVersion(mid)) {
      // 更新res
      res = mid;
      // 找下一个可能的
      right = mid - 1;
    } else {
      left = mid + 1;
    }
  }
  return res;
}