【LeetCode】01矩阵

问题描述 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:web Input: 0 0 0 0 1 0 0 0 0 Output: 0 0 0 0 1 0 0 0

>>阅读原文<<