Leetcode: Shortest Distance from All Buildings

本文介绍了一种寻找空地建造房屋的算法,该房屋到所有建筑物的距离之和最小。使用了广度优先搜索来确定最优位置,并详细展示了如何通过遍历二维网格来计算总距离。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Question

  1. Shortest Distance from All Buildings My Submissions Question
    Total Accepted: 919 Total Submissions: 3251 Difficulty: Hard
    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 2, where:

Each 0 marks an empty land which you can pass by freely.
Each 1 marks a building which you cannot pass through.
Each 2 marks an obstacle which you cannot pass through.
For example, given three buildings at (0,0), (0,4), (2,2), and an obstacle at (0,2):

1 - 0 - 2 - 0 - 1
| | | | |
0 - 0 - 0 - 0 - 0
| | | | |
0 - 0 - 1 - 0 - 0
The point (1,2) is an ideal empty land to build a house, as the total travel distance of 3+3+1=7 is minimal. So return 7.

Note:
There will be at least one building. If it is not possible to build such house according to the above rules, return -1.

Hide Company Tags Google Zenefits
Hide Tags Breadth-first Search
Hide Similar Problems (M) Walls and Gates (H) Best Meeting Point


Solution

Get idea from here.

class Solution(object):
    def shortestDistance(self, grid):
        """
        :type grid: List[List[int]]
        :rtype: int
        """

        m, n, self.nth = len(grid), len(grid[0]), -1
        distance = [ [0]*n for dummy in xrange(m) ]

        for i,row in enumerate(grid):
            for j, num in enumerate(row):
                if num==1:
                    if self.helper(i,j,grid,distance)==False:
                        return -1


        return min([ distance[i][j]
                     for i, row in enumerate(grid)
                     for j, num in enumerate(row)
                     if num == (self.nth+1) ] or [-1] )

    def helper(self, i, j, grid, distance):
        m, n = len(grid), len(grid[0])
        queue, level, nth = collections.deque( [(i,j)] ), 1, self.nth

        count = 0
        while queue:
            for dummy in xrange(len(queue)):
                i, j = queue.popleft()

                for x, y in [(0,1), (0,-1), (1,0), (-1,0)]:
                    nexti, nextj = i+x, j+y
                    if 0<= nexti <m and 0<=nextj<n and grid[nexti][nextj]==(nth+1):
                        count += 1
                        queue.append( (nexti,nextj) )

                        distance[nexti][nextj] += level
                        grid[nexti][nextj] = nth
            level += 1

        self.nth -= 1

        return True if count!=0 else False

Take-home message

  1. 1.
print [1,2,3] or [-1]
=> [1,2,3]

print [] or [-1]
=> [-1]
基于Spring Boot搭建的一个多功能在线学习系统的实现细节。系统分为管理员和用户两个主要模块。管理员负责视频、文件和文章资料的管理以及系统运营维护;用户则可以进行视频播放、资料下载、参与学习论坛并享受个性化学习服务。文中重点探讨了文件下载的安全性和性能优化(如使用Resource对象避免内存溢出),积分排行榜的高效实现(采用Redis Sorted Set结构),敏感词过滤机制(利用DFA算法构建内存过滤树)以及视频播放的浏览器兼容性解决方案(通过FFmpeg调整MOOV原子位置)。此外,还提到了权限管理方面自定义动态加载器的应用,提高了系统的灵活性和易用性。 适合人群:对Spring Boot有一定了解,希望深入理解其实际应用的技术人员,尤其是从事在线教育平台开发的相关从业者。 使用场景及目标:适用于需要快速搭建稳定高效的在线学习平台的企业或团队。目标在于提供一套完整的解决方案,涵盖从资源管理到用户体验优化等多个方面,帮助开发者更好地理解和掌握Spring Boot框架的实际运用技巧。 其他说明:文中不仅提供了具体的代码示例和技术思路,还分享了许多实践经验教训,对于提高项目质量有着重要的指导意义。同时强调了安全性、性能优化等方面的重要性,确保系统能够应对大规模用户的并发访问需求。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值