Leetcode:Toeplitz Matrix

Posted 罗梁

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了Leetcode:Toeplitz Matrix相关的知识,希望对你有一定的参考价值。

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.

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.

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

思路
这纯粹是一道找规律的题目,每一行的前n-1个数和下一行的后n-1个数相同

class Solution(object):
    def isToeplitzMatrix(self, matrix):
        """
        :type matrix: List[List[int]]
        :rtype: bool
        """
        flag = False
        for key,value in enumerate(matrix):
            if key + 1< len(matrix):
                if value[:-1] == matrix[key+1][1:]:
                    continue
                else:
                    flag = False
                    break
            else:
                flag = True
        return flag

以上是关于Leetcode:Toeplitz Matrix的主要内容,如果未能解决你的问题,请参考以下文章

求教hessian matrix~~急~~

矩阵树定理(Matrix Tree)学习笔记

没学过线代也能读懂的CSS3 matrix

生成树计数及应用 Matrix-Tree

MaOC线代使用方法介绍

题解Matrix BZOJ 4128 矩阵求逆 离散对数 大步小步算法