正在加载……
← 返回 google 的题目列表
Shortest Distance to Taxi in a Grid
类型:online_judge
Given a 2D grid with several taxis, find the shortest distance from each cell to any taxi. Example Input grid = [[0,0,0],[0,1,0],[0,0,0]] Output [[0,1,0],[1,0,1],[0,1,0]]