【强化练习】二分搜索算法经典习题

Prerequisites

Before reading this article, you need to learn:

• Basic Binary Heap
• Implementing Priority Queue with Binary Heap

The essence of binary search is to quickly narrow down the search range. This article will show you the classic scenarios of applying binary search in arrays.

Binary Search in 2D Arrays

The previous article Binary Search Framework Explained discussed binary search in one-dimensional arrays. How do we apply binary search in a two-dimensional matrix?

Search a 2D Matrix

Solution

Search a 2D Matrix II

Solution

Binary Search + Array Two-Pointer Technique

Find K Closest Elements

Solution

Finding a Peak

Find Peak Element

Solution

Peak Index in a Mountain Array

Solution

在排序数组中查找数字 LCOF

Solution

缺失的数字 LCOF

Solution

Binary Search on Special Arrays

Search in Rotated Sorted Array

Solution

Search in Rotated Sorted Array II

Solution

loading...