Today's Challenge

https://leetcode.com/problems/search-a-2d-matrix-ii/

Search a 2D Matrix II - LeetCode

오랫만에 내 손으로 풀어봄.
무식하게 x 축으로 한번 쭉 순회하고, y 축으로 한번 쭉 순회하면 된다.

class Solution:
    def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
        found = False
        xmax, ymax = -(10**9) - 1, -(10**9) - 1
        
        for y in range(len(matrix)):
            for x in range(len(matrix[0])):
                if matrix[y][x] == target:
                    found = True                
                xmax = xmax if xmax > matrix[y][x] else matrix[y][x]
                if x == 0:
                    continue
                if matrix[y][x-1] > matrix[y][x]:
                    return False
                
        for x in range(len(matrix[0])):
            for y in range(len(matrix)):
                ymax = ymax if ymax > matrix[y][x] else matrix[y][x]
                if y == 0:
                    continue
                if matrix[y-1][x] > matrix[y][x]:
                    return False
        
        return found