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.

 

matrix = [  

[1,2,3,4],

[5,1,2,3],  

[9,5,1,2]

]

第一次循环，以第一列为基准，分别比较第一列的1,5,9和其对角线是不是相等，

第二次循环，以第一行为基准，分别比较第一行的2,3,4和其对角线是不是相等

#pragma once
#include <iostream>
#include<vector>

using namespace std;

class Solution {
public:
	bool isToeplitzMatrix(vector<vector<int>>& matrix) {
		//i是行,j是列，此时基准为第一列，则比较使j=0不变，i改变
		for (int i =0; i < matrix.size(); i++)
		{
			int row = i+1;//t表示行
			for (int j =1; j < matrix[0].size()&& row <matrix.size(); j++, row++)
			{
				if (matrix[i][0] != matrix[row][j])
				{
					return false;
				}
			}
			
		}
		//i是行,j是列，此时基准为第一行，则i=0不变，j改变

		for (int j = 1; j < matrix[0].size(); j++)
		{
			int col = j+1; //t表示列
			for (int i = 1; i < matrix.size() && col < matrix[0].size(); i++, col++)
			{
				if (matrix[0][j] != matrix[i][col])
				{
					return false;
				}
			}

		}
		return true;
	}
};