LeetCode-766. Toeplitz Matrix 托普利茨矩阵（C++实现）

一、问题描述
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.
题目要求：若矩阵满足：从左上角到右下角的每个对角线具有相同的元素，则该矩阵为托普利茨矩阵。
现给出一个M x N矩阵，编写函数，判断该矩阵是否为托普利茨矩阵。若是，返回true；否则返回false。
二、思路及代码
思路：
首先考虑特殊情况，当给出的矩阵matrix为行向量或列向量（即matrix的行数m或列数n为1）时，无需判断，肯定为托普利茨矩阵&#x