链接:https://leetcode-cn.com/problems/toeplitz-matrix/
class Solution {
public boolean isToeplitzMatrix(int[][] matrix) {
if(matrix==null){
return false;
}
for(int i=0;i<matrix.length-1;i++){
for(int j=0;j<matrix[i].length-1;j++){
if(matrix[i][j]!=matrix[i+1][j+1]){
return false;
}
}
}
return true;
}
}