the Moore neighborhood

最新推荐文章于 2023-07-28 09:36:31 发布

weixin_34250709

最新推荐文章于 2023-07-28 09:36:31 发布

阅读量442

点赞数

文章标签： python

原文链接：https://my.oschina.net/u/2440318/blog/672591

版权

2019独角兽企业重金招聘Python工程师标准>>>

求矩阵中任一点邻居为1 的数量：

def count_neighbours(grid, row, col):
    NEIGHBORS = ((-1, -1), (-1, 0), (-1, 1), (0, -1),
              (0, 1), (1, -1), (1, 0), (1, 1))
    count = 0
    for diff in NEIGHBORS:
        n_row = row + diff[0]
        n_col = col + diff[1]
        if 0<=n_row<len(grid) and 0<=n_col<len(grid[0]):
            if grid[n_row][n_col]:
                count+=1
    return count

if __name__ == '__main__':
    #These "asserts" using only for self-checking and not necessary for auto-testing
    assert count_neighbours(((1, 0, 0, 1, 0),
                             (0, 1, 0, 0, 0),
                             (0, 0, 1, 0, 1),
                             (1, 0, 0, 0, 0),
                             (0, 0, 1, 0, 0),), 1, 2) == 3, "1st example"
    assert count_neighbours(((1, 0, 0, 1, 0),
                             (0, 1, 0, 0, 0),
                             (0, 0, 1, 0, 1),
                             (1, 0, 0, 0, 0),
                             (0, 0, 1, 0, 0),), 0, 0) == 1, "2nd example"
    assert count_neighbours(((1, 1, 1),
                             (1, 1, 1),
                             (1, 1, 1),), 0, 2) == 3, "Dense corner"
    assert count_neighbours(((0, 0, 0),
                             (0, 1, 0),
                             (0, 0, 0),), 1, 1) == 0, "Single"

转载于:https://my.oschina.net/u/2440318/blog/672591