1class Solution:2 def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:3 n = len(matrix[0])45 def get(idx: int) -> int:6 r, c = divmod(idx, n)7 return matrix[r][c]89 return get(bisect_left(range(len(matrix) * n - 1), target, key=get)) == target
WPM •0 •0
ACC •0 •0
TIME •0