[LeetCode]766. Toeplitz Matrix 解题报告(C++)

最新推荐文章于 2021-02-28 05:00:23 发布

原创最新推荐文章于 2021-02-28 05:00:23 发布 · 380 阅读

0 ·

CC 4.0 BY-SA版权

[解题报告] 专栏收录该内容

63 篇文章

订阅专栏

本文介绍了一种判断矩阵是否为Toeplitz矩阵的方法，并提供了一个C++实现示例。Toeplitz矩阵的特点是从左上到右下的每条对角线上的元素相同。通过比较每个元素与其左上方的元素来验证这一特性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

[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.

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].

题目大意

判断一个矩阵是否是 Toeplitz Matrix

解题思路

Check whether each value is equal to the value of it’s top-left neighbor.

代码实现:

class Solution {
public:
    bool isToeplitzMatrix(vector<vector<int>>& matrix) {

    int row = matrix.size();
    int col = matrix[0].size();

    // 检查每个值是否等于其左上角的值
    for (int i = 1; i < row; i++) {
        for (int j = 0; j < col; j++) {
            if (j - 1 >= 0) {
                if (matrix[i][j] != matrix[i - 1][j - 1]) {
                    return false;
                }
            }
        }
    }
    return true;
    }
};