LeetCode | 766. Toeplitz Matrix矩阵操作水题

766. Toeplitz MatrixAmatrix is Toeplitz if every diagonal from top-left to bottom-right has the sameelement.

Nowgiven 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:

1234

5123

9512

 

In the above grid, the diagonals are "[9]","[5, 5]", "[1, 1, 1]", "[2, 2, 2]", "[3,3]", "[4]", and in each diagonal all elements are the same, sothe answer is True.

Example 2:

Input: matrix = [[1,2],[2,2]]

Output: False

Explanation:

The diagonal "[1, 2]" has different elements.

Note:

1.      matrix will be a 2D array of integers.

2.      matrix will have a number of rows and columns in range [1, 20].

3.      matrix[i][j] will be integers in range [0, 99].

矩阵操作的水题，以矩阵左边的上边上的所有点为起始点，向右下角进行遍历，每一次遍历得到的都是一组相等的数字的时候，这个矩阵就是符合要求的矩阵，否则这个矩阵就不是符合要求的矩阵

class Solution {
public:
bool isToeplitzMatrix(vector<vector<int>>& matrix) {
	int r = matrix.size();
	int c = matrix[0].size(); int nr, nc,tmp;
	for (int i = 0; i < r; i++)
	{
		nr = i + 1;
		nc = 1; tmp = matrix[i][0];
		while (nr < r&&nc < c)
		{
			if (matrix[nr][nc] == tmp) { nr++; nc++; }
			else return false;
		}
	}
	for (int i = 1; i < c; i++)
	{
		nr = 0;
		nc = i; tmp = matrix[0][i];
		while (nr < r&&nc < c)
		{
			if (matrix[nr][nc] == tmp) { nr++; nc++; }
			else return false;
		}
	}
	return true;
}
};