766. Toeplitz Matrix

最新推荐文章于 2021-07-23 20:52:15 发布

accumulate_zhang

最新推荐文章于 2021-07-23 20:52:15 发布

阅读量241

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcoding in python

本文链接：https://blog.youkuaiyun.com/accumulate_zhang/article/details/79205190

leetcoding in python 专栏收录该内容

30 篇文章

订阅专栏

本文介绍了一种算法，用于判断一个给定的二维矩阵是否为Toeplitz矩阵。Toeplitz矩阵的特点是从左上到右下的每一条对角线上的元素都相同。文章通过示例详细解释了这一概念，并提供了一段Python代码实现该算法。

摘要生成于 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:
1234
5123
9512

In the above grid, the diagonals are "[9]", "[5, 5]", "[1, 1, 1]", "[2, 2, 2]", "[3, 3]", "[4]", and 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
        """
        for i in range(len(matrix)-1):
            for j in range(len(matrix[0])-1):
                if matrix[i][j]!=matrix[i+1][j+1]:
                    return False
        return True

s=Solution()

m= [[1,2,3,4],[5,1,2,3],[9,5,1,2]]

print(s.isToeplitzMatrix(m))

class Solution {
public boolean isToeplitzMatrix(int[][] matrix) {
for (int i=0; i<matrix.length-1;i++){
for (int j=0; j<matrix[0].length-1;j++) {
if (matrix[i][j]!=matrix[i+1][j+1])
return false;
}
}
return true;
}

}