leetcode

简单交互二分查找

35. 搜索插入位置
704. 二分查找

方法1 暴力解法

var solution = function (isBadVersion) {
  return function (n) {
    let start = 1;
    while (start <= n) {
      if (isBadVersion(start)) return start;
      start++;
    }
  };
};

方法2 二分查找

var solution = function (isBadVersion) {
  return function (n) {
    let l = 1, r = n;
    while (l < r) {
      const mid = ((r - l) >> 1) + l;
      if (isBadVersion(mid)) r = mid; // 错误版本
      else l = mid + 1;
    }
    return l;
  };
};