01 matrix

类别：BFS算法 难度：mediumspa 题目描述 Given a matrix consists of 0 and 1, find the distance of the nearest 0 for each cell.rest The distance between two adjacent cells is 1. input;code 0 0 0 0 1 0 0 0 0 output:

>>阅读原文<<