题目描述：

思路：

先用三元顺序表存放稀疏矩阵

typedef struct{    int row, col;    int elem;} Elem;typedef struct{    int Row, Col, n;    Elem data[10000];} Matrix;

接着行列号互换

    T.Row = matrix.Col;    T.Col = matrix.Row;    T.n = matrix.n;

然后按列号优先的顺序，将原矩阵与转置矩阵T行列元素互换即可

if (T.n)    {        q = 1;        for (j = 0; j < matrix.Col; j++)            for (p = 1; p <= matrix.n; p++)                if (matrix.data[p].col == j)                {                    T.data[q].row = matrix.data[p].col;                    T.data[q].col = matrix.data[p].row;                    T.data[q].elem = matrix.data[p].elem;                    q++;                }    }

#include #include using namespace std;typedef struct{    int row, col;    int elem;} Elem;typedef struct{    int Row, Col, n;    Elem data[10000];} Matrix;int main(){    Matrix matrix;    cin >> matrix.Row >> matrix.Col >> matrix.n;    int N = matrix.n;    int i = 1;    while (N--)    {        int r, c, e;        cin >> r >> c >> e;        matrix.data[i].row = r;        matrix.data[i].col = c;        matrix.data[i].elem = e;        i++;    }    Matrix T;    T.Row = matrix.Col;    T.Col = matrix.Row;    T.n = matrix.n;    int p, q, j;    if (T.n)    {        q = 1;        for (j = 0; j < matrix.Col; j++)            for (p = 1; p <= matrix.n; p++)                if (matrix.data[p].col == j)                {                    T.data[q].row = matrix.data[p].col;                    T.data[q].col = matrix.data[p].row;                    T.data[q].elem = matrix.data[p].elem;                    q++;                }    }    for(i=1;i    {        cout<" "<    }    return 0;}