[LeetCode] 766. Toeplitz Matrix - Java

• 문제 링크

Toeplitz Matrix - LeetCode

 

• 풀이 코드

public class Solution {

    public boolean isToeplitzMatrix(int[][] matrix) {
        int r = matrix.length, c = matrix[0].length;
        for (int i = 1; i < r; i++) for (int j = 1; j < c; j++) if (matrix[i][j] != matrix[i - 1][j - 1]) return false;

        return true;
    }

}