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 in ascending from left to right.
Integers in each column are sorted in ascending from top to bottom.
Example:
Consider the following matrix:
[
[1, 4, 7, 11, 15],
[2, 5, 8, 12, 19],
[3, 6, 9, 16, 22],
[10, 13, 14, 17, 24],
[18, 21, 23, 26, 30]
]
Given target = 5, return true.
Given target = 20, return false.
My code:
class Solution(object):
def searchMatrix(self, matrix, target):
"""
:type matrix: List[List[int]]
:type target: int
:rtype: bool
"""
m=len(matrix)
if m==0:
return False
example=matrix[0]
n=len(example)
if n==0:
return False
for i in range(m):
if matrix[i][0]>target or matrix[i][n-1]<target:
continue
for j in range(n):
if matrix[i][j]==target:
return True
return False
Solution: https://leetcode.com/problems/search-a-2d-matrix-ii/