Leetcode #766. 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.

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

题意

这道题感觉是说给出一个矩阵然后确定这个斜对角的元素是不是相同，要求是所有的斜对角线相同，可以参看例子

解法

比较容易想到的解法就是去依次检查第二行开始的每一行的元素是否和左上角的元素不同，后来看到一种比较有意思的解法就是可以从整个列表元素去作对比，比如说两个相邻的行$r_i$和$r_{i+1}$，如果这个矩阵是满足定义的话，那么$r_i[0:-1]$应该会和$r_{i+1}[1:]$ 相同，从整体的角度去考虑，代码可以显得更为简洁一些，直接从行的角度去遍历

第一种：

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

第二种：

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