LeetCode-74、搜索二维矩阵-中等
编写一个高效的算法来判断 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
代码1:
class Solution:
def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
if not matrix or not matrix[0]:
return False
m = len(matrix)
n = len(matrix[0])
head = 0
end = m * n
while head < end:
mid = (head + end) // 2
x = mid // n
y = mid % n
if target < matrix[x][y]:
end = mid
elif target == matrix[x][y]:
return True
elif target > matrix[x][y]:
head = mid + 1
return False
代码2:
class Solution:
def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
if not matrix or not matrix[0]:
return False
else:
list1 = []
for i in range(len(matrix)):
for j in range(len(matrix[0])):
list1.append(matrix[i][j])
head = 0
end = len(list1)
while head < end:
mid = (head + end) // 2
if list1[mid] > target:
end = mid
elif list1[mid] < target:
head = mid + 1
elif list1[mid] == target:
return True
return False