766. Toeplitz Matrix

最新推荐文章于 2021-01-11 15:21:41 发布

cainiaohudi

最新推荐文章于 2021-01-11 15:21:41 发布

阅读量163

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/cainiaohudi/article/details/82384459

leetcode 专栏收录该内容

9 篇文章

订阅专栏

本文介绍了一种算法，用于判断给定的矩阵是否为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.

class Solution(object):
    def isToeplitzMatrix(self, matrix):
        """
        :type matrix: List[List[int]]
        :rtype: bool
        """
        height = len(matrix)
        width = len(matrix[0])
        for i in range(height-1):
            for j in range(width-1):
                if matrix[i][j] != matrix[i+1][j+1]:
                    return False
        return True