【python3】leetcode 766. Toeplitz Matrix（easy）

momottyy

于 2019-01-13 20:33:20 发布

阅读量225

点赞数

分类专栏： leetcode python

本文链接：https://blog.youkuaiyun.com/maotianyi941005/article/details/86435941

版权

leetcode 同时被 2 个专栏收录

126 篇文章

订阅专栏

python

120 篇文章

订阅专栏

本文介绍了一种算法，用于判断一个给定的矩阵是否为Toeplitz矩阵，即矩阵中从左上到右下的每条对角线上的元素是否都相同。通过遍历矩阵并比较相邻行的对应元素，可以高效地完成这一判断。

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

766. Toeplitz Matrix（easy）

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:
    def isToeplitzMatrix(self, matrix):
        """
        :type matrix: List[List[int]]
        :rtype: bool
        """

        for i in range(1,len(matrix)):
            if matrix[i][1:] != matrix[i-1][:-1]:return False
        return True