leetcode-892 三维形体的表面积 Python

Xenonon

于 2020-03-25 11:20:13 发布

阅读量182

点赞数

文章标签： python leetcode 算法

本文链接：https://blog.csdn.net/Xenonon/article/details/105090723

版权

class Solution:
    def surfaceArea(self, grid: List[List[int]]) -> int:
        def neighbours(i, j):
            overlap = 0
            for di, dj in ((1, 0), (-1, 0), (0, 1), (0, -1)):
                if 0<= i + di < len(grid) and 0 <= j +dj < len(grid[0]):
                    overlap += min(grid[i][j], grid[i + di][j + dj])
            return overlap


        ans = 0
        for i in range(len(grid)):
            for j in range(len(grid[0])):
                if grid[i][j] != 0:
                    ans += 4 * grid[i][j] + 2 - neighbours(i, j)
        return ans