Count Square Submatrices with All Ones LeetCode solution in JavaScript

1
/**
2
 * @param {number[][]} matrix
3
 * @return {number}
4
 */
5
var countSquares = function (matrix) {
6
  let count = 0;
7
  for (let i = 0; i < matrix.length; ++i) {
8
    for (let j = 0; j < matrix[0].length; ++j) {
9
      if (matrix[i][j] === 0) continue;
10
      if (i > 0 && j > 0) {
11
        matrix[i][j] += Math.min(
12
          matrix[i - 1][j],
13
          matrix[i][j - 1],
14
          matrix[i - 1][j - 1]
15
        );
16
      }
17
      count += matrix[i][j];
18
    }
19
  }
20
  return count;
21
};