遍历二维数组并找到“封闭的房间”

def find_closed_rooms(matrix):
    rows = len(matrix)
    cols = len(matrix[0])
    closed_rooms = []

    def dfs(i, j):
        if i < 0 or i >= rows or j < 0 or j >= cols or matrix[i][j] != 0:
            return
        matrix[i][j] = -1  # 标记已访问过的房间
        dfs(i+1, j)  # 向下搜索
        dfs(i-1, j)  # 向上搜索
        dfs(i, j+1)  # 向右搜索
        dfs(i, j-1)  # 向左搜索

    for i in range(rows):
        for j in range(cols):
            if matrix[i][j] == 0:
                is_closed = True
                dfs(i, j)
                for k in range(rows):
                    if matrix[k][0] == 0 or matrix[k][cols-1] == 0:
                        dfs(k, 0)
                        dfs(k, cols-1)
                for k in range(cols):
                    if matrix[0][k] == 0 or matrix[rows-1][k] == 0:
                        dfs(0, k)
                        dfs(rows-1, k)
                for m in range(rows):
                    for n in range(cols):
                        if matrix[m][n] == 0:
                            is_closed = False
                            break
                if is_closed:
                    closed_rooms.append((i, j))

    return closed_rooms