题目描述:
3 x 3 的幻方是一个填充有从 1 到 9 的不同数字的 3 x 3 矩阵,其中每行,每列以及两条对角线上的各数之和都相等。
给定一个由整数组成的 N × N 矩阵,其中有多少个 3 × 3 的 “幻方” 子矩阵?(每个子矩阵都是连续的)。
示例 1:
输入: [[4,3,8,4],
[9,5,1,9],
[2,7,6,2]]
输出: 1
解释:
下面的子矩阵是一个 3 x 3 的幻方:
438
951
276
而这一个不是:
384
519
762
总的来说,在本示例所给定的矩阵中只有一个 3 x 3 的幻方子矩阵。
提示:
1 <= grid.length = grid[0].length <= 10
0 <= grid[i][j] <= 15
注意题目中的两个条件1-9中的数字,并且不能重复,几天没写代码,这么简单的题目,竟然写了四十分钟…
class Solution {
//19点07分
public static int numMagicSquaresInside(int[][] grid) {
int result = 0;
//以行作为外循环,列作为内循环
for (int i = 0; i < grid.length; i++) {
if(i + 2 < grid.length){
for (int j = 0; j < grid[i].length; j++) {
if(j + 2 < grid[i].length){
//送入判断函数进行判断
if(is3(i, j, grid)){
result++;
}
}else {
break;
}
}
}else {
break;
}
}
return result;
}
public static boolean is3(int x, int y, int [][]A){
//注意还要是不同的数字
int tems[] = new int[10];
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
if(A[x + i][y + j] <=9){
tems[A[x + i][y + j]] ++;
}else {
return false;
}
}
}
for (int i = 1; i <= 9; i++) {
int j = tems[i];
if(j != 1){
return false;
}
}
int tem = A[x][y] + A[x+1][y] + A[x+2][y];
for (int i = 0; i < 3; i++) {
if(A[x][y + i] + A[x + 1][y + i] + A[x + 2][y + i] != tem){
return false;
}
if(A[x+i][y] + A[x+i][y + 1] + A[x+i][y + 2] !=tem){
return false;
}
}
//判断两个对角
if(A[x][y] + A[x+1][y+1] + A[x+2][y+2] != tem || A[x][y+2] + A[x+1][y+1]+ A[x+2][y] != tem)
return false;
return true;
}
}
排名靠前的代码
class Solution {
public int numMagicSquaresInside(int[][] grid) {
int R = grid.length, C = grid[0].length;
int ans = 0;
for (int r = 0; r < R-2; ++r)
for (int c = 0; c < C-2; ++c) {
if (grid[r+1][c+1] != 5) continue; // optional skip
if (magic(grid[r][c], grid[r][c+1], grid[r][c+2],
grid[r+1][c], grid[r+1][c+1], grid[r+1][c+2],
grid[r+2][c], grid[r+2][c+1], grid[r+2][c+2]))
ans++;
}
return ans;
}
public boolean magic(int... vals) {
int[] count = new int[16];
for (int v: vals) count[v]++;
for (int v = 1; v <= 9; ++v)
if (count[v] != 1)
return false;
return (vals[0] + vals[1] + vals[2] == 15 &&
vals[3] + vals[4] + vals[5] == 15 &&
vals[6] + vals[7] + vals[8] == 15 &&
vals[0] + vals[3] + vals[6] == 15 &&
vals[1] + vals[4] + vals[7] == 15 &&
vals[2] + vals[5] + vals[8] == 15 &&
vals[0] + vals[4] + vals[8] == 15 &&
vals[2] + vals[4] + vals[6] == 15);
}
这个代码没怎么看懂
class Solution {
public int numMagicSquaresInside(int[][] grid) {
int R = grid.length, C = grid[0].length;
int ans = 0;
for (int r = 0; r < R-2; ++r)
for (int c = 0; c < C-2; ++c) {
if (grid[r+1][c+1] != 5) continue; // optional skip
if (magic(grid[r][c], grid[r][c+1], grid[r][c+2],
grid[r+1][c], grid[r+1][c+1], grid[r+1][c+2],
grid[r+2][c], grid[r+2][c+1], grid[r+2][c+2]))
ans++;
}
return ans;
}
public boolean magic(int... vals) {
int[] count = new int[16];
for (int v: vals) count[v]++;
for (int v = 1; v <= 9; ++v)
if (count[v] != 1)
return false;
return (vals[0] + vals[1] + vals[2] == 15 &&
vals[3] + vals[4] + vals[5] == 15 &&
vals[6] + vals[7] + vals[8] == 15 &&
vals[0] + vals[3] + vals[6] == 15 &&
vals[1] + vals[4] + vals[7] == 15 &&
vals[2] + vals[5] + vals[8] == 15 &&
vals[0] + vals[4] + vals[8] == 15 &&
vals[2] + vals[4] + vals[6] == 15);
}
}