题目描述:
编写一个高效的算法来判断 m x n 矩阵中,是否存在一个目标值。该矩阵具有如下特性:
每行中的整数从左到右按升序排列。
每行的第一个整数大于前一行的最后一个整数。
示例 1:
输入:
matrix = [
[1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
target = 3
输出: true
示例 2:
输入:
matrix = [
[1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
target = 13
输出: false
解题方案:
将二维数组转化为一维数组,仍然可以使用二分法:
class Solution:
def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
row = len(matrix)
if row == 0:
return False
col = len(matrix[0])
l = 0
r = row * col - 1
while l <= r:
mid = (l + r) // 2
m_row = mid // col
m_col = mid % col
if matrix[m_row][m_col] == target:
return True
elif matrix[m_row][m_col] < target:
l = mid + 1
else:
r = mid - 1
return False
class Solution:
def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
if matrix == None or len(matrix) == 0 or len(matrix[0]) == 0:
return False
lo, hi = 0, len(matrix)-1
while lo <= hi:
mid = (lo+hi)//2
if matrix[mid][0] > target:
hi = mid - 1
elif matrix[mid][0] < target:
lo = mid + 1
else:
return True
row = hi
lo, hi = 0, len(matrix[0])-1
while lo <= hi:
mid = (lo + hi) // 2
if matrix[row][mid] < target:
lo = mid + 1
elif matrix[row][mid] > target:
hi = mid - 1
else:
return True
return False
是否可以采用内置二分法模块bisect???