题目
解法思路: 广度优先遍历 BFS
代码记录
class Solution:
def isToeplitzMatrix(self, matrix: List[List[int]]) -> bool:
m,n = len(matrix),len(matrix[0])
queue = [(0,n-1)]
while queue:
next_queue=[]
values=[]
for node in queue:
values.append(matrix[node[0]][node[1]])
if node[1]>0 and (node[0],node[1]-1) not in next_queue:
next_queue.append((node[0],node[1]-1))
if node[0]<m-1 and (node[0]+1,node[1]) not in next_queue:
next_queue.append((node[0]+1,node[1]))
if len(list(set(values)))!=1:
return False
queue = next_queue
return True