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 from left to right.
- The first integer of each row is greater than the last integer of the previous row.
For example,
Consider the following matrix:
[ [1, 3, 5, 7], [10, 11, 16, 20], [23, 30, 34, 50] ]
Given target = 3
, return true
.
方法一:先最每行第一个数组进行二分法查找,锁定某一行后再对那一行进行二分查找。
class Solution(object):
def searchMatrix(self, matrix, target):
"""
:type matrix: List[List[int]]
:type target: int
:rtype: bool
"""
if not matrix or matrix==[[]]:
return False
m = len(matrix)
n = len(matrix[0])
row = m-1
for i in range(m):
if target < matrix[i][0]:
row = i-1
break
l,r = 0, n-1
while l <= r:
mid = (l+r)/2
val = matrix[row][mid]
if val == target:
return True
elif val < target:
l = mid+1
else:
r = mid-1
return False
方法二:从左下角(或右上角)出发,依次与target比较,这样时间复杂度为O(m + n)
class Solution(object):
def searchMatrix(self, matrix, target):
"""
:type matrix: List[List[int]]
:type target: int
:rtype: bool
"""
if not matrix:
return False
m = len(matrix)
n = len(matrix[0])
row = m-1
col = 0
while row >= 0 and col < n:
if target == matrix[row][col]:
return True
elif target > matrix[row][col]:
col += 1
else:
row -= 1
return False