Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:
- Integers in each row are sorted in ascending from left to right.
- Integers in each column are sorted in ascending from top to bottom.
For example,
Consider the following matrix:
[ [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] ]
Given target = 5
, return true
.
Given target = 20
, return false
.
可能偏差的思路:
比如对2.1(b),竖着的灰条和横着的灰条会有重叠的左上角的深灰块部分,深灰块就是重叠部分。这个思路是二叉搜索,已经比遍历的好了,但是还不够好,看看剑指Offer提供的思路。
注意事项:
看我的python解法(翻译该C++解法):
class Solution(object):
def searchMatrix(self, matrix, target):
"""
:type matrix: List[List[int]]
:type target: int
:rtype: bool
"""
if len(matrix)==0: return False
rows=len(matrix)
columns=len(matrix[0])
row=0
column=columns-1
while (row<=rows-1 and column>=0):
if (matrix[row][column]== target):
return True
elif (matrix[row][column]<target):
row=row+1
else:
column=column-1
return False