力扣链接：704.二分查找

难度：⭐

解题关键词：二分查找

解题思路：二分查找最重要的是寻找 mid，然后处理边界。其中 mid = Math.floor((right - left) / 2) + left

function search(nums: number[], target: number): number {
  let left = 0;
  let right = nums.length - 1;

  while (left <= right) {
    const mid = Math.floor((right - left) / 2) + left;

    if (nums[mid] === target) return mid;

    if (nums[mid] < target) {
      left = mid + 1;
    } else {
      right = mid - 1;
    }
  }

  return -1;
}