稀疏矩阵的C++实现

 实现部分：

include <iostream>
#include <iomanip>
#include <map>
using namespace std;
class matrix{
	friend ostream &operator<<(ostream &,matrix&);
private:
	int row, column, num;
	map<int, map<int, int>> m;  //行号→（列号，值）
public:
	matrix() = default;
	matrix(int r, int c, int n) :row(r), column(c), num(n) {}
	matrix &operator=(const matrix &right)
	{
		row = right.row;
		column = right.column;
		num = right.num;
		m = right.m;
	}
	void add(int r, int c, int val){ m[r].emplace(c, val); }
	int Row() const { return row; }
	int Column() const { return column; }
	matrix transpose() const
	{
		matrix temp(column, row, num);
		for (auto it = m.begin(); it != m.end(); ++it)  //这一行的元素
		{
			const map<int, int> &elems = it->second;
			for (auto it2 = elems.begin(); it2 != elems.end(); ++it