[leetcode]766. Toeplitz Matrix

A matrix is Toeplitz if every diagonal from top-left to bottom-right has the same element.
Now given an M x N matrix, return True if and only if the matrix is Toeplitz.

Example 1:
Input:
matrix = [
[1,2,3,4],
[5,1,2,3],
[9,5,1,2]
]
Output: True
Explanation:
In the above grid, the diagonals are:
“[9]”, “[5, 5]”, “[1, 1, 1]”, “[2, 2, 2]”, “[3, 3]”, “[4]”.
In each diagonal all elements are the same, so the answer is True.

Example 2:
Input:
matrix = [
[1,2],
[2,2]
]
Output: False
Explanation:
The diagonal “[1, 2]” has different elements.

Note:
matrix will be a 2D array of integers.
matrix will have a number of rows and columns in range [1, 20].
matrix[i][j] will be integers in range [0, 99].

Follow up:
What if the matrix is stored on disk, and the memory is limited such that you can only load at most one row of the matrix into the memory at once?
What if the matrix is so large that you can only load up a partial row into the memory at once?

我的方法

算法思想：沿对角线进行比较，每次将整条对角线比较完成。
性能：12ms faster than 98.42%

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

其他解法

算法思想：遍历矩阵，将每一个元素与其左上角元素相比较
性能：未知

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