二分法JavaScript

//寻找左边界
function findLeftBound(nums,target){
  if (nums.length == 0)
    return -1;
//关键代码
/******/
  let left = 0;
  let right = nums.length;
  while (left < right){
    let mid = left + Math.floor((right - left)/2);
    if(nums[mid] >= target){
      right = mid;
    }else if(nums[mid] < target){
      left = mid + 1;
    }
  }
/*****/
  if(nums[left] == target){
    return left;
  }
  return -1;
}

//寻找右边界
function findRightBound(nums,target){
  if (nums.length == 0)
    return -1;
  let left = 0;
  let right = nums.length;
//关键代码
/*******/
  while (left < right){
    let mid = left + Math.floor((right - left)/2);
    if(nums[mid] < target){
      left = mid + 1;
    }else if(nums[mid] > target){
      right = mid;
    }else{
      left = mid + 1;
    }
  }
/*******/
  console.log(left)
  if(nums[left - 1] == target){
    return left - 1;
  }
}