给定一个数字列表，找出所有矩阵，使每列和行加起来为264

def findMatrices(matrix, rowSum, colSum, targetSum, currentRow, currentCol, result):
    if currentRow == len(matrix):
        if all(sum(col) == targetSum for col in zip(*matrix)):
            result.append(matrix)
        return

    if currentCol == len(matrix[0]):
        findMatrices(matrix, rowSum, colSum, targetSum, currentRow + 1, 0, result)
        return

    for num in range(1, 10):
        if num not in matrix[currentRow] and num not in [matrix[i][currentCol] for i in range(currentRow)]:
            matrix[currentRow][currentCol] = num
            findMatrices(matrix, rowSum, colSum, targetSum, currentRow, currentCol + 1, result)
            matrix[currentRow][currentCol] = 0

def findMatricesWithSum(targetSum):
    matrix = [[0] * 9 for _ in range(9)]
    rowSum = [targetSum] * 9
    colSum = [targetSum] * 9
    result = []
    findMatrices(matrix, rowSum, colSum, targetSum, 0, 0, result)
    return result

result = findMatricesWithSum(264)
for matrix in result:
    print(matrix)