码迷,mamicode.com
首页 > 其他好文 > 详细

542. 01 Matrix

时间:2018-06-23 14:34:18      阅读:172      评论:0      收藏:0      [点我收藏+]

标签:最短路径   ast   ace   amp   路径问题   for   sts   elements   nsis   

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:

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

 关键词 "...find the distance of the nearest 0 for each cell..."->最短路径问题->使用BFS。

542. 01 Matrix

标签:最短路径   ast   ace   amp   路径问题   for   sts   elements   nsis   

原文地址:https://www.cnblogs.com/ruisha/p/9216934.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!