稀疏矩阵的快速转置代码

以下是稀疏矩阵快速转置的Python代码实现：

def sparse_matrix_transpose(matrix):
    """
    :param matrix: 稀疏矩阵
    :return: 转置后的稀疏矩阵
    """
    # 获取矩阵的行、列、非零元素个数
    rows, cols, vals = matrix[0], matrix[1], matrix[2]
    n = len(rows)

    # 统计每一列的非零元素个数
    col_counts = [0] * cols
    for i in range(n):
        col_counts[rows[i]] += 1

    # 计算每一列的起始位置
    col_starts = [0] * (cols + 1)
    col_starts[0] = 0
    for i in range(1, cols + 1):
        col_starts[i] = col_starts[i - 1] + col_counts[i - 1]

    # 创建新的稀疏矩阵
    new_rows = [0] * n
    new_cols = [0] * n
    new_vals = [0] * n
    for i in range(n):
        col = rows[i]
        start = col_starts[col]
        new_rows[start] = cols[i]
        new_cols[start] = rows[i]
        new_vals[start] = vals[i]
        col_starts[col] += 1

    # 返回转置后的稀疏矩阵
    return [cols, rows, vals]

该代码实现的思路是先统计每一列的非零元素个数，然后计算每一列的起始位置，最后创建新的稀疏矩阵。