编译可以通过但没有输出，不知道错在哪，好难受。。。。
#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
const int maxn = 5;

typedef struct {
    int i, j;
    int val;
}Triple;

typedef struct {
    Triple data[maxn + 1];
    int row, col, sum;
}TSMatrix;

void sort_triple(TSMatrix M, TSMatrix &T)
{
    T.row = M.col;  
    T.col = M.row;
    T.sum = M.sum;
    int num[maxn + 1];
    int cpot[maxn + 1];
    if (T.sum)
    {
        for (int col = 1; col <= M.col; col++)    num[col] = 0;
        for (int i = 1; i <= M.sum; i++)   num[M.data[i].j]++;
        cpot[1] = 1;
        for (int i = 2; i <= M.col; i++)   cpot[i] = cpot[i - 1] + num[i - 1];
        for (int i = 1; i <= M.sum; i++)
        {
            int col = M.data[i].j;
            int tt = cpot[col];
            T.data[tt].i = M.data[i].j;
            T.data[tt].j = M.data[i].i;
            T.data[tt].val = M.data[i].val;
            cpot[col]++;
        }
    }
}

int main()
{
    TSMatrix a;
    int k = 0;
    int aa[maxn][maxn] = {
    {0,0,0,4,0},
    {0,0,0,0,0},
    {1,0,0,0,0},
    {0,3,0,0,0},
    {0,0,2,0,0}
    };
    for (int i = 0; i < maxn; i++)
    {
        for (int j = 0; j < maxn; j++)
        {
            if (aa[maxn][maxn])
            {
                k++;
                a.data[k].i = i+1;
                a.data[k].j = j+1;
                a.data[k].val = aa[i][j];
            }
        }
    }
    a.row = maxn;
    a.col = maxn;
    a.sum = k;
    TSMatrix b;
    sort_triple(a, b);
    int bb[maxn][maxn] = { 0 };
    for (int p = 1; p <= b.sum; p++)
    {
        int x = b.data[p].i-1;
        int y = b.data[p].j-1;
        int value= b.data[p].val;
        bb[x][y] = value;
    }
    puts("转置前:");
    for (int i = 0; i < maxn; i++)
    {
        for (int j = 0; j < maxn; j++)
        {
            printf("%d ", aa[i][j]);
        }
        puts("");
    }
    puts("转置后:");
    for (int i = 0; i < maxn; i++)
    {
        for (int j = 0; j < maxn; j++)
        {
            printf("%d ", bb[i][j]);
        }
        puts("");
    }
    system("pause");
    return 0;


}

if (aa[maxn][maxn]) 应该是 if (aa[i][j]) 吧？

整个代码……
sort_triple完全看不懂
下标竟然从1开始，这个没办法忍了

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

template<typename T> class  SparseMaxtrix
{
public:
    SparseMaxtrix() : rownum_(), colnum_(), nodes_()
    {
    }
    template<size_t ROW, size_t COL> SparseMaxtrix( const T (&arr)[ROW][COL] ) : rownum_(ROW), colnum_(COL), nodes_()
    {
        for( size_t r=0; r!=ROW; ++r )
            for( size_t c=0; c!=COL; ++c )
                if( arr[r][c] != T() )
                    nodes_.push_back( Node_{r,c,arr[r][c]} );
    }
    SparseMaxtrix( const SparseMaxtrix& m ) = default;
    SparseMaxtrix( SparseMaxtrix&& m ) : rownum_(), colnum_(), nodes_()
    {
        std::swap( rownum_, m.rownum_ );
        std::swap( colnum_, m.colnum_ );
        nodes_.swap( m.nodes_ );
    }
    SparseMaxtrix& operator=( const SparseMaxtrix& m ) = default;
    SparseMaxtrix& operator=( SparseMaxtrix&& m )
    {
        std::swap( rownum_, m.rownum_ );
        std::swap( colnum_, m.colnum_ );
        nodes_.swap( m.nodes_ );
        return *this;
    }
    SparseMaxtrix Transpose() const
    {
        SparseMaxtrix result;
        result.rownum_ = colnum_;
        result.colnum_ = rownum_;
        result.nodes_.reserve( nodes_.size() );
        for( typename std::vector<Node_>::const_iterator itor=nodes_.begin(); itor!=nodes_.end(); ++itor )
            result.nodes_.push_back( Node_{itor->col,itor->row,itor->value} );
        std::sort( result.nodes_.begin(), result.nodes_.end(), [](const Node_& a, const Node_& b){return a.row!=b.row ? a.row<b.row : a.col<b.col;} );
        return result;
    }

private:
    size_t rownum_, colnum_;
    struct Node_ {
        size_t row, col;
        T value;
    };
    std::vector<Node_> nodes_;

    friend std::ostream& operator<<( std::ostream& os, const SparseMaxtrix& m )
    {
        typename std::vector<Node_>::const_iterator itor = m.nodes_.begin();
        for( size_t r=0; r!=m.rownum_; ++r )
        {
            for( size_t c=0; c!=m.colnum_; ++c )
            {
                if( itor!=m.nodes_.end() && r==itor->row && c==itor->col )
                {
                    os << itor->value;
                    ++itor;
                }
                else
                    os << T();

                os << (c+1!=m.colnum_?' ':'\n');
            }
        }
        return os;
    }
};

int main( void )
{
    int arr[5][4] = { 0, 0, 0, 4
                    , 0, 0, 0, 0
                    , 1, 0, 0, 5
                    , 0, 3, 0, 0
                    , 0, 0, 2, 0 };

    SparseMaxtrix<int> a = arr;
    SparseMaxtrix<int> b = a.Transpose();

    cout << "转置前:\n" << a << '\n';
    cout << "转置后:\n" << b << '\n';
}

输出