Technology Sharing

한어Русский языкEnglishFrançaisIndonesianSanskrit日本語DeutschPortuguêsΕλληνικάespañolItalianoSuomalainenLatina

Give you a satisfying the following two propertiesm x nInteger matrices:

• The integers in each row are arranged in non-strictly increasing order from left to right.
• The first integer in each row is greater than the last integer in the previous row.

Give you an integertarget,iftargetIn the matrix, returntrue; Otherwise, returnfalse 。

hint:

• m == matrix.length
• n == matrix[i].length
• 1 <= m, n <= 100
• -104 <= matrix[i][j], target <= 104

Idea: First find the possible row, if it is in the row, then return true

class Solution(object):
    def searchMatrix(self, matrix, target):
        """
        :type matrix: List[List[int]]
        :type target: int
        :rtype: bool
        """
        # 思路：先查找可能所在的行，如果在行里边，那么就返回true
        m = len(matrix)
        n = len(matrix[0])
        for i in range(m):
            if target in matrix[i]: # 如果在这一行中
                return True
            if target > matrix[i][n-1]: # 如果大于这一行最后一个元素值，那么就下一行
                continue
        return False