题目来源:https://leetcode.com/problems/search-a-2d-matrix/description/
题目:
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
题意分析:
给出了有规则的二维矩阵,规则是从左向右依次递增,从上向下依次递增。进行查找某一特定值是否存在在该矩阵中。
思路分析:
显然,当矩阵为空时返回false。
若矩阵不为空,则从矩阵的左上角开始查找。
若当前值等于查找值,则返回true。
若当前值小于查找值,则往下一行开始查找。
若当前值大于查找值,则往当前行左边开始查找。
若查找至矩阵最左边或矩阵最下边依旧找不到查找值,则返回false。
代码:
class Solution(object):
def searchMatrix(self, matrix, target):
"""
:type matrix: List[List[int]]
:type target: int
:rtype: bool
"""
if not matrix:
return False
rows = len(matrix)
cols = len(matrix[0])
row = 0
col = cols -1
while True:
if row < rows and col >= 0:
if matrix[row][col] == target:
return True
elif matrix[row][col] < target:
row += 1
else:
col -= 1
else:
return False