搜索二维矩阵
编写一个高效的算法来判断 m x n 矩阵中,是否存在一个目标值。该矩阵具有如下特性:
每行中的整数从左到右按升序排列。
每行的第一个整数大于前一行的最后一个整数。
示例 1:
输入:matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 3
输出:true
示例 2:
输入:matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 13
输出:false
提示:
m == matrix.length
n == matrix[i].length
1 <= m, n <= 100
-104 <= matrix[i][j], target <= 104
题解
class Solution:
"""
处理思路:
1.先对列进行二分处理,找到小于target 的最大第一个元素的列
2.对此列进行二分, 找到推行的target
3.空间复杂度为O1 时间复杂的为log(m+n)
"""
def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
col_first = 0
col_last = len(matrix) - 1
row_first = 0
row_last = len(matrix[0]) - 1
row_data = self.column_binary(matrix, col_first, col_last, target)
return self.row_binary(row_data, row_first, row_last, target)
def column_binary(self, matrix, col_first, col_last, target):
if col_last == 0:
return matrix[0]
# 对列的第一个元素进行二分对比
while col_last >= col_first:
mid = col_first + (col_last-col_first)//2
print('mid:', mid)
if matrix[mid][0] <= target:
# mid + 1 > col_last 处理[[1],[3]] 3 这种情况
if mid+1 > col_last or matrix[mid+1][0] > target:
# matrix[mid] 就是我们想要找的列:
return matrix[mid]
else:
col_first = mid + 1
else:
col_last = mid - 1
return matrix[col_last]
def row_binary(self, row_data, row_first, row_last, target):
# 对行进行二分
while row_last >= row_first:
mid = row_first + (row_last-row_first)//2
print('mid_Val:', row_data[mid])
if row_data[mid] == target:
return True
elif row_data[mid] > target:
row_last = mid - 1
else:
row_first = mid + 1
return False