-
Notifications
You must be signed in to change notification settings - Fork 0
/
0074_Search_a_2D_Matrix.py
29 lines (26 loc) · 1 KB
/
0074_Search_a_2D_Matrix.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
class Solution:
def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
def searchRow(matrix: List[List[int]], target: int) -> List[int]:
N = len(matrix)
if N == 1:
return matrix[0]
midi = N // 2
if matrix[midi][0] > target:
return searchRow(matrix[:midi], target)
else:
return searchRow(matrix[midi:], target)
def searchCol(ls: List[int], target: int) -> bool:
print(ls)
M = len(ls)
if M == 1 and ls[0] == target:
return True
elif M == 1:
return False
midi = M // 2
if ls[midi] > target:
return searchCol(ls[:midi], target)
else:
return searchCol(ls[midi:], target)
if len(matrix) == 0 or len(matrix[0]) == 0:
return False
return searchCol(searchRow(matrix, target), target)