leetcode-74 two-dimensional matrix search
Subject description:
Prepared by an efficient algorithm to determine the mxn matrix, the presence or absence of a target value. This matrix has the following characteristics: an integer of from left to right in each row in ascending order. The first integer is greater than the last row of each integer previous row.
class Solution:
def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
if len(matrix) < 1 or len(matrix[0]) < 1:
return False
row = len(matrix)
col = len(matrix[0])
row_i, col_i = 0, col-1
while True:
if matrix[row_i][col_i] == target:
return True
if matrix[row_i][col_i] > target and col_i > 0:
col_i -= 1
elif matrix[row_i][col_i] < target and row_i < row-1:
row_i += 1
else:
return False