766. Toeplitz Matrix

最新推荐文章于 2020-11-05 21:52:03 发布

三笔竹林

最新推荐文章于 2020-11-05 21:52:03 发布

阅读量315

点赞数 1

分类专栏： Leetcode python 文章标签： leetcode python

本文链接：https://blog.csdn.net/u011462357/article/details/79193654

版权

python 同时被 2 个专栏收录

28 篇文章 0 订阅

订阅专栏

Leetcode

24 篇文章 0 订阅

订阅专栏

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

我的解法：

用try catch的方法做边界判断，不是防止index out of range,而是尽管去index out of range,我把异常捕获到，不影响继续运行程序，即可。

class Solution(object):
    def isToeplitzMatrix(self, matrix):
        """
        :type matrix: List[List[int]]
        :rtype: bool
        """
    
        M=len(matrix)
        N=len(matrix[0])
        for i in range(0,M):#在第M行
            for j in range(0,N):#在第N列
                try:
                    if (matrix[i][j]!=matrix[i+1][j+1]):
                        return False
                
                except:
                        pass
        return True