Skip to content

Latest commit

 

History

History
117 lines (47 loc) · 1.03 KB

README_EN.md

File metadata and controls

117 lines (47 loc) · 1.03 KB

中文文档

Description

Given a matrix consists of 0 and 1, find the distance of the nearest 0 for each cell.

The distance between two adjacent cells is 1.

 

Example 1:

Input:

[[0,0,0],

 [0,1,0],

 [0,0,0]]



Output:

[[0,0,0],

 [0,1,0],

 [0,0,0]]

Example 2:

Input:

[[0,0,0],

 [0,1,0],

 [1,1,1]]



Output:

[[0,0,0],

 [0,1,0],

 [1,2,1]]

 

Note:

    <li>The number of elements of the given matrix will not exceed 10,000.</li>
    
    <li>There are at least one 0 in the given matrix.</li>
    
    <li>The cells are adjacent in only four directions: up, down, left and right.</li>
    

Solutions

Python3

Java

...