-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path766 Toeplitz Matrix.py
87 lines (70 loc) · 2.02 KB
/
766 Toeplitz 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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
#!/usr/bin/python3
"""
A matrix is Toeplitz if every diagonal from top-left to bottom-right has the
same element.
Now given an M x N matrix, return True if and only if the matrix is Toeplitz.
Example 1:
Input:
matrix = [
[1,2,3,4],
[5,1,2,3],
[9,5,1,2]
]
Output: True
Explanation:
In the above grid, the diagonals are:
"[9]", "[5, 5]", "[1, 1, 1]", "[2, 2, 2]", "[3, 3]", "[4]".
In each diagonal all elements are the same, so the answer is True.
Example 2:
Input:
matrix = [
[1,2],
[2,2]
]
Output: False
Explanation:
The diagonal "[1, 2]" has different elements.
Note:
matrix will be a 2D array of integers.
matrix will have a number of rows and columns in range [1, 20].
matrix[i][j] will be integers in range [0, 99].
Follow up:
What if the matrix is stored on disk, and the memory is limited such that you
can only load at most one row of the matrix into the memory at once?
What if the matrix is so large that you can only load up a partial row into the
memory at once?
"""
from typing import List
class Solution:
def isToeplitzMatrix(self, matrix: List[List[int]]) -> bool:
m, n = len(matrix), len(matrix[0])
for i in range(1, m):
for j in range(1, n):
if matrix[i][j] != matrix[i-1][j-1]:
return False
return True
def isToeplitzMatrix_complex(self, matrix: List[List[int]]) -> bool:
"""
Brute force iteration will work
need a good way to go through the matrix
"""
m, n = len(matrix), len(matrix[0])
for j in range(n):
r = 0
c = j
cur = matrix[r][c]
while r < m and c < n:
if cur != matrix[r][c]:
return False
r += 1
c += 1
for i in range(1, m):
r = i
c = 0
cur = matrix[r][c]
while r < m and c < n:
if cur != matrix[r][c]:
return False
r += 1
c += 1
return True