对矩阵进行排序，使其在每条对角线上具有最大值

import numpy as np

def sort_matrix_diagonals(matrix):
    m, n = matrix.shape
    diagonals = [[] for _ in range(m + n - 1)]

    # 找到每条对角线上的最大值
    for i in range(m):
        for j in range(n):
            diagonal_index = j - i + m - 1
            diagonals[diagonal_index].append(matrix[i][j])

    # 对每条对角线上的元素进行排序
    for diagonal in diagonals:
        diagonal.sort(reverse=True)

    # 将排序后的元素重新放回矩阵
    for i in range(m):
        for j in range(n):
            diagonal_index = j - i + m - 1
            matrix[i][j] = diagonals[diagonal_index].pop(0)

    return matrix

# 示例矩阵
matrix = np.array([[4, 2, 3],
                   [1, 5, 6],
                   [9, 8, 7]])

sorted_matrix = sort_matrix_diagonals(matrix)
print(sorted_matrix)

[[9 8 7]
 [6 5 4]
 [3 2 1]]