Skip to content

feat: add solutions to lc No.0840 #3386

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 9 commits into from
Closed
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
40 changes: 40 additions & 0 deletions solution/0800-0899/0840.Magic Squares In Grid/Solution.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,40 @@
/**
* @param {number[][]} grid
* @return {number}
*/
var numMagicSquaresInside = function(grid) {
const isMagic = (i, j) => {
const s = new Set();
for (let x = 0; x < 3; x++) {
for (let y = 0; y < 3; y++) {
const num = grid[i + x][j + y];
if (num < 1 || num > 9 || s.has(num)) return false;
s.add(num);
}
}

const rowSum = grid[i][j] + grid[i][j+1] + grid[i][j+2];
if (rowSum !== grid[i+1][j] + grid[i+1][j+1] + grid[i+1][j+2]) return false;
if (rowSum !== grid[i+2][j] + grid[i+2][j+1] + grid[i+2][j+2]) return false;

const colSum1 = grid[i][j] + grid[i+1][j] + grid[i+2][j];
const colSum2 = grid[i][j+1] + grid[i+1][j+1] + grid[i+2][j+1];
const colSum3 = grid[i][j+2] + grid[i+1][j+2] + grid[i+2][j+2];
if (rowSum !== colSum1 || rowSum !== colSum2 || rowSum !== colSum3) return false;

if (rowSum !== grid[i][j] + grid[i+1][j+1] + grid[i+2][j+2]) return false;
if (rowSum !== grid[i][j+2] + grid[i+1][j+1] + grid[i+2][j]) return false;

return true;
};

let count = 0;

for (let i = 0; i < grid.length - 2; i++) {
for (let j = 0; j < grid[0].length - 2; j++) {
if (isMagic(i, j)) count++;
}
}

return count;
};
Loading