在找到第一个数字后在二维数组中找到正确的组合

def find_combination(matrix, target):
    rows = len(matrix)
    cols = len(matrix[0])
    visited = [[False] * cols for _ in range(rows)]
    result = []

    def dfs(row, col, path):
        if row < 0 or row >= rows or col < 0 or col >= cols or visited[row][col]:
            return

        path.append(matrix[row][col])
        visited[row][col] = True

        if sum(path) == target:
            result.append(path[:])

        dfs(row - 1, col, path)
        dfs(row + 1, col, path)
        dfs(row, col - 1, path)
        dfs(row, col + 1, path)

        path.pop()
        visited[row][col] = False

    for i in range(rows):
        for j in range(cols):
            if matrix[i][j] == target:
                dfs(i, j, [])

    return result