leetcode 766. Toeplitz Matrix -java

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

题意：各对角线数（不是主对角线）相等就返回true，否则false

思路：逐个比较与自己右下方（如果存在的话）的数是否相等，一旦不等就返回false，最后可以返回true；

bug:1、true打错成ture还没看出来，就生生换了一种麻烦的思路折腾了一个小时
2、所有的bug都在麻烦的思路里
3、注意比相等时要比右下角存在的数，刚开始的for

知识点：1、在函数中return false就直接跳出了这个函数，结束了程序，不会再执行后面的return true了

class Solution {
    public boolean isToeplitzMatrix(int[][] matrix) {
        int n = matrix.length;//i,行数
        int m = matrix[0].length;//j,列数
        for(int i=0;i<n-1;i++) {
            for(int j=0;j<m-1;j++) {
                if(matrix[i][j]!=matrix[i+1][j+1]){
                    return false;
                }
            }
        }
        return true;
    }
}