|
马上注册,结交更多好友,享用更多功能^_^
您需要 登录 才可以下载或查看,没有账号?立即注册
x
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 from left to right.
The first integer of each row is greater than the last integer of the previous row.
Example 1:
Input:
matrix = [
[1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
target = 3
Output: true
Example 2:
Input:
matrix = [
[1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
target = 13
Output: 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
-
- row, col = 0, len(matrix[0]) - 1
- while row < len(matrix) and col >= 0:
- curt = matrix[row][col]
-
- if curt < target:
- row +=1
- elif curt > target:
- col -= 1
- else:
- return True
- return False
复制代码 |
|