蓝桥杯刷题--python-30

AcWing 687. 扫雷（每日一题） - AcWing

t=int(input())

def dfs(a,b):
    t=g[a][b]
    g[a][b]=-1
    if (t):return

    for x in range(a-1,a+2):
        for y in range(b-1,b+2):
            if x>=0 and x<n and y>=0 and y<n and g[x][y]!=-1:
                dfs(x,y)
for l in range(t):
    n=int(input())
    st=[]
    for _ in range(n):
        st.append(list(input()))
    # print(st)
    g=[[0 for _ in range (n)] for _ in range(n)]
    for i in range(n):
        for j in range(n):
            if st[i][j]=="*": g[i][j]=-1
            else:
                g[i][j]=0
                for x in range(i-1,i+2):