码迷,mamicode.com
首页 > 其他好文 > 详细

Leetcode:Toeplitz Matrix

时间:2018-02-20 23:13:33      阅读:208      评论:0      收藏:0      [点我收藏+]

标签:code   log   思路   blog   strong   als   leetcode   exp   key   

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

标签:code   log   思路   blog   strong   als   leetcode   exp   key   

原文地址:https://www.cnblogs.com/xmxj0707/p/8455960.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!