-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsorted_matrix_zero.py
53 lines (41 loc) · 1.2 KB
/
sorted_matrix_zero.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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
def find_zeros_array(array):
if len(array) == 0 or array[0] == 1:
return 0
first = 0
last = len(array)
while last - first != 1:
guess = (last + first) / 2
if array[guess] == 0 and (len(array) == guess + 1 or array[guess + 1]) == 1:
return guess + 1
elif array[guess] == 1 and array[guess - 1] == 0:
return guess
elif array[guess] == 0 and array[guess + 1] == 0:
first = guess + 1
else:
last = guess
def get_zeros(matrix):
result = 0
for i in matrix:
result += find_zeros_array(i)
return result
def find_one_diagonal(martix):
d_size = min(len(matrix), len(matrix[0]))
return find_zeros_array([matrix[i][i] for i in range(d_size)])
if __name__ == "__main__":
matrix = [
[0, 0, 0, 0, 1],
[0, 0, 0, 1, 1],
[0, 0, 0, 1, 1],
[1, 1, 1, 0, 1],
[1, 1, 1, 1, 0]
]
matrix2 = [
[0, 0, 0, 0, 0, 0, 0, 1],
[0, 0, 0, 1, 1, 1, 1, 1],
[0, 0, 1, 1, 1, 1, 1, 1],
[0, 0, 1, 1, 1, 1, 1, 1],
[1, 1, 1, 1, 1, 1, 1, 1]
]
# print find_one_diagonal(matrix)
vector = [[0]]
print find_one_diagonal(vector)