566. 重塑矩阵 https://leetcode.cn/problems/reshape-the-matrix
566. Reshape the Matrix https://leetcode.com/problems/reshape-the-matrix
74. 搜索二维矩阵 https://leetcode.cn/problems/search-a-2d-matrix
74. Search a 2D Matrix https://leetcode.com/problems/search-a-2d-matrix
240. 搜索二维矩阵 II https://leetcode.cn/problems/search-a-2d-matrix-ii
240. Search a 2D Matrix II https://leetcode.com/problems/search-a-2d-matrix-ii
392. 判断子序列 https://leetcode.cn/problems/is-subsequence
392. Is Subsequence https://leetcode.com/problems/is-subsequence
792. 匹配子序列的单词数 https://leetcode.cn/problems/number-of-matching-subsequences
792. Number of Matching Subsequences https://leetcode.com/problems/number-of-matching-subsequences
658. 找到 K 个最接近的元素 https://leetcode.cn/problems/find-k-closest-elements
658. Find K Closest Elements https://leetcode.com/problems/find-k-closest-elements
35. 搜索插入位置 https://leetcode.cn/problems/search-insert-position
35. Search Insert Position https://leetcode.com/problems/search-insert-position
162. 寻找峰值 https://leetcode.cn/problems/find-peak-element
162. Find Peak Element https://leetcode.com/problems/find-peak-element
852. 山脉数组的峰顶索引 https://leetcode.cn/problems/peak-index-in-a-mountain-array
852. Peak Index in a Mountain Array https://leetcode.com/problems/peak-index-in-a-mountain-array
33. 搜索旋转排序数组 https://leetcode.cn/problems/search-in-rotated-sorted-array
33. Search in Rotated Sorted Array https://leetcode.com/problems/search-in-rotated-sorted-array
81. 搜索旋转排序数组 II https://leetcode.cn/problems/search-in-rotated-sorted-array-ii
81. Search in Rotated Sorted Array II https://leetcode.com/problems/search-in-rotated-sorted-array-ii
二分搜索的精髓在于快速收缩搜索区间。本文带大家看一看二分搜索算法在数组中的经典运用场景。
前文 二分搜索框架详解 讲的二分搜索都是在一维数组中的，在二维矩阵中如何施展二分搜索呢？
