二分查找算法详解

Metadata

• Author: labuladong
• Full Title: 二分查找算法详解
• Category: articles
• URL: https://github.com/labuladong/fucking-algorithm/blob/master/%E7%AE%97%E6%B3%95%E6%80%9D%E7%BB%B4%E7%B3%BB%E5%88%97/%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE%E8%AF%A6%E8%A7%A3.md

Highlights

• 两端都闭 (View Highlight)
• if (nums[mid] < target) { left = mid + 1; } else if (nums[mid] > target) { right = mid - 1; } else if (nums[mid] == target) { // 别返回，锁定左侧边界 right = mid - 1; (View Highlight)
• left = mid + 1; } else if (nums[mid] > target) { right = mid - 1; } else if (nums[mid] == target) { // 别返回，锁定右侧边界 left = mid + 1; } (View Highlight)
• nums[left - 1] (View Highlight)

New highlights added November 13, 2023 at 7:09 PM

• if (left nums.length) return -1; // 判断一下 nums[left] 是不是 target return nums[left] target ? left : -1; (View Highlight)