Package g0501_0600.s0542_01_matrix

Class Solution

java.lang.Object

g0501_0600.s0542_01_matrix.Solution

public class Solution
extends Object

542 - 01 Matrix.<p>Medium</p> <p>Given an <code>m x n</code> binary matrix <code>mat</code>, return <em>the distance of the nearest</em> <code>0</code> <em>for each cell</em>.</p> <p>The distance between two adjacent cells is <code>1</code>.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2021/04/24/01-1-grid.jpg" alt="" /></p> <p><strong>Input:</strong> mat = [[0,0,0],[0,1,0],[0,0,0]]</p> <p><strong>Output:</strong> [[0,0,0],[0,1,0],[0,0,0]]</p> <p><strong>Example 2:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2021/04/24/01-2-grid.jpg" alt="" /></p> <p><strong>Input:</strong> mat = [[0,0,0],[0,1,0],[1,1,1]]</p> <p><strong>Output:</strong> [[0,0,0],[0,1,0],[1,2,1]]</p> <p><strong>Constraints:</strong></p> <ul> <li><code>m == mat.length</code></li> <li><code>n == mat[i].length</code></li> <li><code>1 <= m, n <= 10⁴</code></li> <li><code>1 <= m * n <= 10⁴</code></li> <li><code>mat[i][j]</code> is either <code>0</code> or <code>1</code>.</li> <li>There is at least one <code>0</code> in <code>mat</code>.</li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int[][]	updateMatrix(int[][] mat)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

updateMatrix

public int[][] updateMatrix(int[][] mat)