public boolean checkXMatrix(int[][] grid) {
int n = grid.length;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
if (i == j || (i + j) == (n - 1)) {
if (grid[i][j] == 0) {
return false;
}
} else if (grid[i][j] != 0) {
return false;
}
}
}
return true;
}
2023.1.31-----leetcode.2319
最新推荐文章于 2024-10-02 23:40:03 发布