leetcode 766. 托普利茨矩阵
2018-03-27 20:22
274 查看
class Solution: def isToeplitzMatrix(self, matrix): """ :type matrix: List[List[int]] :rtype: bool """ m=len(matrix) n=len(matrix[0]) for i in range(m): data=matrix[i][0] j=0 while i<m and j<n: if matrix[i][j] is not data: return False i+=1 j+=1 for j in range(n): data=matrix[0][j] i=0 while i<m and j<n: if matrix[i][j] is not data: return False i+=1 j+=1 return True
相关文章推荐
- leetCode 766. 托普利茨矩阵
- <easy>LeetCode Problem -- 766. Toeplitz Matrix
- LeetCode 766. Toeplitz Matrix
- LeetCode | 766. Toeplitz Matrix矩阵操作水题
- 766. Toeplitz Matrix (leetcode)
- Leetcode 766. Toeplitz Matrix (Java)
- LeetCode766. Toeplitz Matrix
- LeetCode 766. Toeplitz Matrix
- 【LeetCode】766. Toeplitz Matrix(Toeplitz矩阵)
- LeetCode - 766. Toeplitz Matrix
- LeetCode -- First Missing Positive
- Leetcode 85. Maximal Rectangle
- (JAVA)LeetCode-14. Longest Common Prefix
- Leetcode的couting bits
- leetcode 660. Remove 9
- LeetCode Beautiful Arrangement
- LeetCode之Construct Binary Tree from Inorder and Postorder Traversal
- 60_leetcode_Reorder List
- LeetCode-E-Two Sum
- [Leetcode] Linked list cycle 判断链表是否有环