【题目】
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
【理解题意】:matrix具有元素逐行逐个值不断增大的性质。
【解题思路】:要找到一个有效的查找算法,不能对matrix元素进行逐个遍历,而应该对先判断target的值在matrix哪一行的区间范围中,再判断该行是否包含target的值。需要注意的有①target可能不在matrix的任何一行的区间范围中②各种为空的可能。
【下面根据代码进行讲解步骤】:
class Solution(object):
def searchMatrix(self, matrix, target):
"""
:type matrix: List[List[int]]
:type target: int
:rtype: bool
"""
if not matrix:
return False
target_row = 0
for row in matrix:
if not row:
target_row += 1
elif row[-1] < target:
target_row += 1
else:
break
if target_row >=len(matrix):
return False
if target in matrix[target_row]:
return True
else:
return False
算法步骤:
①判断matrix是否为空
②逐行比较边界值大小,确定target_row
③判断target_row是否越界
④判断target是否在target_row中
【总结】:在解答本题的过程中出现了没有考虑matrix为空的特殊情况,造成错误,但很快能改正过来,总的来说不算难。
题目url:https://leetcode.com/problems/search-a-2d-matrix/description/