Solution: 01 Matrix

Let's solve the 01 Matrix problem using the Dynamic Programming pattern.

Statement

Given an m×nm \times n binary matrix, mat, find the distance from each cell to the nearest 00. The distance between two adjacent cells is 11. Cells to the left, right, above, and below the current cell will be considered adjacent.

Constraints:

  • 11 \leq mat.row , mat.col50\leq 50

  • 11 \leq mat.row * mat.col 2500\leq 2500

  • mat[i][j] ...