[Leetcode] 317. Shortest Distance from All Buildings 解題報告

題目:ide You want to build a house on an empty land which reaches all buildings in the shortest amount of distance. You can only move up, down, left and right. You are given a 2D grid of values 0, 1 or 
相關文章
相關標籤/搜索