[LeetCode&Python] Problem 766. Toeplitz Matrix-优快云博客

本文介绍了一种算法，用于判断一个给定的MxN矩阵是否为Toeplitz矩阵，即每条从左上到右下的对角线上的元素是否相同。通过遍历矩阵的对角线并比较元素，该算法能有效验证矩阵是否符合Toeplitz矩阵的定义。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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].

class Solution:
    def isToeplitzMatrix(self, matrix):
        """
        :type matrix: List[List[int]]
        :rtype: bool
        """
        Flag=True
        m=len(matrix)
        n=len(matrix[0])
        
        for i in range(m):
            row=i
            column=0
            stan=matrix[i][0]
            while row<m and column<n:
                if matrix[row][column]!=stan:
                    Flag=False
                    break
                row+=1
                column+=1
        
        if Flag:
            for j in range(1,n):
                column=j
                row=0
                stan=matrix[0][j]
                while column<n and row<m:
                    if matrix[row][column]!=stan:
                        Flag=False
                        break
                    row+=1
                    column+=1
        
        return Flag

转载于:https://www.cnblogs.com/chiyeung/p/9758901.html