2892: 最好的草

解题思路:

注意事项:

参考代码:

n,m=map(int,input().strip().split())

l = [list(j for j in input()) for i in range(n)]

s = [[-1,0],[0,-1],[1,0],[0,1]]

c = 0

for i in range(n):

    for j in range(m):

        if l[i][j] == '#':

            l[i][j] = '.'

            for k in s:

                a = i+k[0]

                b = j+k[1]

                if (0 <= a < n) and (0 <= b < m) and l[a][b] == '#':

                    l[a][b] = "."

                    break

            c += 1

print(c)