【Leetcode_easy】766. Toeplitz Matrix

problem

766. Toeplitz Matrix

solution1:

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

参考

1. Leetcode_easy_766. Toeplitz Matrix;

2. Grandyang;

完