0
点赞
收藏
分享

微信扫一扫

【Leetcode_easy】766. Toeplitz Matrix

吴wuwu 2022-07-12 阅读 107

problem

​​766. Toeplitz Matrix​​

solution1:

class Solution {
public:
bool isToeplitzMatrix(vector<vector<int>>& matrix) {
for(int i=0; i<matrix.size()-1; ++i)
{
for(int j=0; j<matrix[0].size()-1; ++j)
{
if(matrix[i][j] != matrix[i+1][j+1]) return false;
}
}
return true;
}
};

 

参考

1. ​​Leetcode_easy_766. Toeplitz Matrix​​;

2. ​​Grandyang​​;

举报

相关推荐

0 条评论