Package g0501_0600.s0542_01_matrix

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    542 - 01 Matrix\.

    Medium

    Given an m x n binary matrix mat, return the distance of the nearest 0 for each cell.

    The distance between two adjacent cells is 1.

    Example 1:

    Input: mat = \[\[0,0,0],0,1,0,0,0,0]

    Output: [0,0,0,0,1,0,0,0,0]

    Example 2:

    Input: mat = \[\[0,0,0],0,1,0,1,1,1]

    Output: [0,0,0,0,1,0,1,2,1]

    Constraints:

    • m == mat.length

    • n == mat[i].length

    • <code>1 <= m, n <= 10<sup>4</sup></code>

    • <code>1 <= m * n <= 10<sup>4</sup></code>

    • mat[i][j] is either 0 or 1.

    • There is at least one 0 in mat.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Array<IntArray> updateMatrix(Array<IntArray> mat)

      • Methods inherited from class java.lang.Object

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