[leetcode] 240. Search a 2D Matrix II @ python-CSDN博客

本文链接：https://blog.csdn.net/danspace1/article/details/88545820

本文介绍了一种高效的矩阵搜索算法，用于在一个具有特定排序属性的二维矩阵中查找特定值。该算法优于暴力搜索，通过从矩阵的右上角开始，根据目标值与当前值的比较结果，决定向下或向左移动，直至找到目标值或确定不存在。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

原题

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.

解法1

Brute Force

代码

class Solution(object):
    def searchMatrix(self, matrix, target):
        """
        :type matrix: List[List[int]]
        :type target: int
        :rtype: bool
        """
        for row in matrix:
            if target in row:
                return True
        return False

解法2

从右上角往左下角查找, 当target大于每行最右边的值时, 说明要往下一行查找, 当taget小于每行最右边的值时, 根据matrix的性质, 说明要往左边的列查找.

代码

class Solution(object):
    def searchMatrix(self, matrix, target):
        """
        :type matrix: List[List[int]]
        :type target: int
        :rtype: bool
        """
        # base case
        if not matrix or not matrix[0]: return False
        
        row, col = len(matrix), len(matrix[0])        
        r, c = 0, col-1
        while r < row and c >= 0:
            if target == matrix[r][c]:
                return True
            elif target > matrix[r][c]:
                r += 1
            else:
                c -= 1
        return False