766. 托普利茨矩阵

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

标签：托普,matrix,利茨,int,766,++,return,size
来源： https://blog.csdn.net/qq_41078889/article/details/113928803