原题地址:https://leetcode.com/problems/search-a-2d-matrix-ii/
写一个高效的算法来搜索m*n的矩阵,该矩阵有如下属性:
- 每行整数从左到右升序排列
- 每列整数从上到下升序排列
例子:
针对如下矩阵
[
[1, 4, 7, 11, 15],
[2, 5, 8, 12, 19],
[3, 6, 9, 16, 22],
[10, 13, 14, 17, 24],
[18, 21, 23, 26, 30]
]如果目标是5,返回true
如果目标是20,返回false