采用顺序表及有头结点的单链表为存储结构，实现稀疏矩阵的创建、销毁、复制、转置以及两个矩阵相加、相减、相乘的运算。

首先应输入矩阵的行数和列数，以及非零元个数并判别给出的矩阵的行、列数对于要求作的运算是否匹配。

-With the order form and has a head node is a single linked list storage structure, sparse matrix to achieve the creation, destruction, copy, transpose, and two matrix addition, subtraction, multiplication operations. Should first enter the matrix of rows and columns, and the number of non-zero element and determine the matrix given the row, the number of columns required for the operation for the match.