FazBrowse GitHub Viewer | Trending | | Home

Tools: [Download Repo ZIP] [View Raw Code] [Original HTTPS Page]

LeetCode-Solutions/Python/toeplitz-matrix.py at master · pythonpeixun/LeetCode-Solutions · GitHub

28 lines (24 loc) · 800 Bytes

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

# Time: O(m * n)

# Space: O(1)

class Solution(object):

def isToeplitzMatrix(self, matrix):

"""

:type matrix: List[List[int]]

:rtype: bool

"""

return all(i == 0 or j == 0 or matrix[i-1][j-1] == val

for i, row in enumerate(matrix)

for j, val in enumerate(row))

class Solution2(object):

def isToeplitzMatrix(self, matrix):

"""

:type matrix: List[List[int]]

:rtype: bool

"""

for row_index, row in enumerate(matrix):

for digit_index, digit in enumerate(row):

if not row_index or not digit_index:

continue

if matrix[row_index - 1][digit_index - 1] != digit:

return False

return True

Back | FazBrowse Home | New Git URL